Submission #345276


Source Code Expand

#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <unordered_map>
#include <iterator>
#include <functional>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int n;

int main(int argc, char *argv[]){
	ios::sync_with_stdio(false);
	while(cin >> n){
		set<int> s;
		REP(i, n){
			int x;
			cin >> x;
			s.insert(x/2);
		}
		cout << s.size() << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User zerokugi
Language C++11 (GCC 4.8.1)
Score 0
Code Size 2597 Byte
Status WA
Exec Time 107 ms
Memory 5416 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 0 / 20 0 / 30 0 / 50
Status
AC × 1
WA × 2
AC × 12
WA × 11
AC × 2
WA × 11
AC × 14
WA × 29
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 26 ms 920 KB
subtask0_1.txt WA 27 ms 920 KB
subtask0_2.txt WA 24 ms 924 KB
subtask1_0.txt AC 25 ms 928 KB
subtask1_1.txt WA 25 ms 1052 KB
subtask1_10.txt AC 25 ms 928 KB
subtask1_11.txt AC 25 ms 1048 KB
subtask1_12.txt AC 25 ms 1056 KB
subtask1_13.txt AC 26 ms 1056 KB
subtask1_14.txt AC 26 ms 932 KB
subtask1_15.txt AC 25 ms 1056 KB
subtask1_16.txt AC 26 ms 1052 KB
subtask1_17.txt AC 25 ms 928 KB
subtask1_18.txt AC 27 ms 1060 KB
subtask1_19.txt AC 24 ms 932 KB
subtask1_2.txt WA 25 ms 972 KB
subtask1_3.txt WA 24 ms 1052 KB
subtask1_4.txt WA 26 ms 1048 KB
subtask1_5.txt WA 25 ms 864 KB
subtask1_6.txt WA 25 ms 1056 KB
subtask1_7.txt WA 25 ms 936 KB
subtask1_8.txt WA 26 ms 928 KB
subtask1_9.txt WA 25 ms 1056 KB
subtask2_0.txt AC 89 ms 5404 KB
subtask2_1.txt WA 97 ms 4956 KB
subtask2_2.txt WA 95 ms 5028 KB
subtask2_3.txt WA 98 ms 5028 KB
subtask2_4.txt WA 99 ms 4972 KB
subtask2_5.txt WA 96 ms 5028 KB
subtask2_6.txt WA 97 ms 5028 KB
subtask2_7.txt WA 97 ms 5032 KB
subtask2_8.txt WA 100 ms 5028 KB
subtask2_9.txt WA 97 ms 5028 KB
subtask3_0.txt AC 87 ms 5416 KB
subtask3_1.txt WA 105 ms 5416 KB
subtask3_2.txt WA 104 ms 5404 KB
subtask3_3.txt WA 106 ms 5412 KB
subtask3_4.txt WA 102 ms 5416 KB
subtask3_5.txt WA 102 ms 5400 KB
subtask3_6.txt WA 102 ms 5412 KB
subtask3_7.txt WA 107 ms 5404 KB
subtask3_8.txt WA 101 ms 5392 KB
subtask3_9.txt WA 106 ms 5408 KB