Submission #2124694


Source Code Expand

#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0;i < (n);i++)
#define P pair<int,int>
#define pb push_back
#define mk make_pair
using namespace std;
const int INF = 1 << 20;

typedef long long ll;




int main(){
  int n;
  set <int> s;
  cin >> n;
  vector <int> a;
  REP(i,n){
    int b;
    cin >> b;
    s.insert(b);
  }
  /*
  //sort(a.begin(),a.end());
  int b = a[0],num = 1;
  for(int i = 1;i < a.size();i++){
    if(b == a[i]){
      num++;
      if(i == a.size()-1){
	if(num != 1 && num%2 == 1){
	  cout << i << num <<endl;
	  a.erase(a.begin()+i+1-num,a.begin()+i);
	}
      }
    }
    
    else{
      b = a[i];
      //cout << num << endl;
      if(num != 1 && num%2 == 1){
	a.erase(a.begin()+i-num,a.begin()+i-1);
	i = i - num+1;
      }
      else if(num != 1 && num%2 == 0){
	//cout << 1 << endl;
	a.erase(a.begin()+i-num,a.begin()+i-1);
	i = i - num+1;
      }
      
      num = 1;
    }
  }
  b = a[0];
  num = 0;
  for(int i = 1;i < a.size();i++){
    if(a[i-1] == a[i])
      num++;
  }
  if(num%2 == 1)
    num++;
  int res = a.size();
  if(a.size()%2 == 0)
    res--;
  cout << res << endl;
  */
  /*
  REP(i,a.size()){
    cout << a[i] << "  ";
    }*/
  int res = s.size();
  if(res%2 == 0)
    res--;
  cout <<res << endl;
  return 0;
}

Submission Info

Submission Time
Task D - Card Eater
User kodamune
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1346 Byte
Status AC
Exec Time 55 ms
Memory 4992 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 17
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 AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 3 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 33 ms 256 KB
07.txt AC 33 ms 256 KB
08.txt AC 43 ms 640 KB
09.txt AC 32 ms 256 KB
10.txt AC 32 ms 256 KB
11.txt AC 42 ms 640 KB
12.txt AC 33 ms 256 KB
13.txt AC 38 ms 384 KB
14.txt AC 55 ms 4992 KB
15.txt AC 29 ms 256 KB