Submission #345559


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;


int main(){
  int N, a;
  vector<int> v;
  cin >> N;
  rep(i,N){
    cin >> a;
    v.push_back(a);
  }
  sort(ALLOF(v));

  int ret = 0;
  map<int,int> memo;
  rep(i,v.size()){
    int a = v[i];
    bool flg = false;
    while(true){
      if(memo.count(a)>0){
        flg = true;
        break;
      }
      
      if(a%2==1 || a==0) break;
      a/=2;
    }
    if(!flg){
      memo[v[i]] = 1;
      ret++;
    }
  }
  cout << ret << endl;
  
  return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User phyllo
Language C++ (G++ 4.6.4)
Score 100
Code Size 1010 Byte
Status AC
Exec Time 185 ms
Memory 5868 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 50 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 43
Set Name Test Cases
Sample subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
Subtask2 subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 24 ms 920 KB
subtask0_1.txt AC 22 ms 796 KB
subtask0_2.txt AC 23 ms 804 KB
subtask1_0.txt AC 25 ms 924 KB
subtask1_1.txt AC 24 ms 1060 KB
subtask1_10.txt AC 25 ms 1048 KB
subtask1_11.txt AC 24 ms 920 KB
subtask1_12.txt AC 25 ms 936 KB
subtask1_13.txt AC 27 ms 1052 KB
subtask1_14.txt AC 27 ms 928 KB
subtask1_15.txt AC 27 ms 856 KB
subtask1_16.txt AC 26 ms 1048 KB
subtask1_17.txt AC 26 ms 1052 KB
subtask1_18.txt AC 26 ms 928 KB
subtask1_19.txt AC 26 ms 936 KB
subtask1_2.txt AC 25 ms 932 KB
subtask1_3.txt AC 25 ms 864 KB
subtask1_4.txt AC 27 ms 872 KB
subtask1_5.txt AC 25 ms 924 KB
subtask1_6.txt AC 25 ms 928 KB
subtask1_7.txt AC 27 ms 924 KB
subtask1_8.txt AC 26 ms 932 KB
subtask1_9.txt AC 26 ms 924 KB
subtask2_0.txt AC 133 ms 5792 KB
subtask2_1.txt AC 152 ms 5028 KB
subtask2_2.txt AC 151 ms 5024 KB
subtask2_3.txt AC 152 ms 5016 KB
subtask2_4.txt AC 153 ms 5020 KB
subtask2_5.txt AC 156 ms 5020 KB
subtask2_6.txt AC 156 ms 5024 KB
subtask2_7.txt AC 160 ms 5016 KB
subtask2_8.txt AC 153 ms 5020 KB
subtask2_9.txt AC 156 ms 5028 KB
subtask3_0.txt AC 134 ms 5780 KB
subtask3_1.txt AC 183 ms 5868 KB
subtask3_2.txt AC 184 ms 5792 KB
subtask3_3.txt AC 182 ms 5792 KB
subtask3_4.txt AC 177 ms 5788 KB
subtask3_5.txt AC 182 ms 5780 KB
subtask3_6.txt AC 180 ms 5788 KB
subtask3_7.txt AC 179 ms 5796 KB
subtask3_8.txt AC 182 ms 5788 KB
subtask3_9.txt AC 185 ms 5776 KB