fork download 
  1.  
  2.     #include <bits/stdc++.h>
  3.  
  4.     using namespace std;
  5.  
  6.     using ll = long long;
  7.     const int MOD = 1000000007; 
  8.     const int MOD2 =  998244353; 
  9.     const ll INF = 1e18;
  10.     const int MX = 1000001; //check the limits, dummy
  11.  
  12.  
  13.     ll modExp(ll base, ll power) {
  14.         if (power == 0) {
  15.             return 1;
  16.         } else {
  17.             ll cur = modExp(base, power / 2); cur = cur * cur; cur = cur % MOD;
  18.             if (power % 2 == 1) cur = cur * base;
  19.             cur = cur % MOD;
  20.             return cur;
  21.         }
  22.     }
  23.  
  24.     ll inv(ll base) {
  25.         return modExp(base, MOD-2);
  26.     }
  27.  
  28.  
  29.     ll mul(ll A, ll B) {
  30.         return (A*B)%MOD;
  31.     }
  32.  
  33.     ll add(ll A, ll B) {
  34.         return (A+B)%MOD;
  35.     }
  36.  
  37.     ll dvd(ll A, ll B) {
  38.         return mul(A, inv(B));
  39.     }
  40.  
  41.     ll sub(ll A, ll B) {
  42.         return (A-B+MOD)%MOD;
  43.     }
  44.  
  45.     ll* facs = new ll[MX];
  46.     ll* facInvs = new ll[MX];
  47.  
  48.     ll choose(ll a, ll b) {
  49.         if (b > a) return 0;
  50.         if (a < 0) return 0;
  51.         if (b < 0) return 0;
  52.         ll cur = facs[a];
  53.         cur = mul(cur, facInvs[b]);
  54.         cur = mul(cur, facInvs[a-b]);
  55.         return cur;
  56.     }
  57.  
  58.     void initFacs() {
  59.         facs[0] = 1; 
  60.         facInvs[0] = 1;
  61.         for (int i = 1 ; i < MX ; i ++ ) {
  62.             facs[i] = (facs[i-1] * i) % MOD;
  63.             facInvs[i] = inv(facs[i]);
  64.         }
  65.     }
  66.  
  67.     void solve() {
  68.         ll n,k,d ;
  69.         cin >> n >> k >> d; 
  70.         vector<ll> arr(n); 
  71.         vector<ll> arr2(k); 
  72.         for (int i = 0 ; i < n; i ++) {
  73.             cin >> arr[i]; 
  74.         }
  75.  
  76.         for (int i = 0 ;i < k ; i++) {
  77.             cin >> arr2[i]; 
  78.         }
  79.         int start = 0; 
  80.         for (int i = 1 ; i <= n ; i++) {
  81.             if (i == arr[i - 1]) {
  82.                 start ++; 
  83.             }
  84.         }
  85.  
  86.         if (start > 0 ) {
  87.             cout << start + (d - 1)/2 << endl;
  88.         } else {
  89.             cout << d/2 << endl;
  90.         }
  91.  
  92.  
  93.  
  94.  
  95.     }
  96.     int main()  {
  97.         ios_base::sync_with_stdio(0); cin.tie(0);  
  98.  
  99.         int t ; cin >> t; 
  100.         while (t --) {
  101.             solve();
  102.         }        
  103.  
  104.  
  105.         return 0;
  106.     }
  107.  
Success #stdin #stdout 0.01s 5312KB
comments (?)
stdin 
5
3 4 4
1 2 3
1 3 2 3
6 2 3
6 1 2 4 1 5
6 6
5 1 1
0 5 0 5 0
5
1 1 1
1
1
3 4 6
1 2 3
1 3 2 3
stdout 
4
2
0
1
5
https://ideone.com/yam22s
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!