Submission #1842552


Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}

int card[100005];
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll N ; cin >> N;
  rep(i,N){
    ll inp; cin >> inp;
    card[inp]++;
  }

  ll ans = 0;
  rep(i,N) ans += (i%2);

  cout << ans << endl;

  //cout << fixed << setprecision(16) << ans << endl;
  return 0;
}

Submission Info

Submission Time
Task D - Card Eater
User ukohank517
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1087 Byte
Status WA
Exec Time 9 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 1
AC × 1
WA × 16
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt
Case Name Status Exec Time Memory
00_example_01.txt WA 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt WA 1 ms 384 KB
02.txt WA 2 ms 384 KB
03.txt WA 1 ms 512 KB
04.txt WA 1 ms 512 KB
05.txt WA 1 ms 512 KB
06.txt WA 9 ms 512 KB
07.txt WA 9 ms 512 KB
08.txt WA 9 ms 640 KB
09.txt WA 9 ms 512 KB
10.txt WA 9 ms 384 KB
11.txt WA 9 ms 640 KB
12.txt WA 9 ms 512 KB
13.txt WA 9 ms 640 KB
14.txt WA 9 ms 640 KB
15.txt WA 9 ms 256 KB