Submission #7591200
Source Code Expand
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const int INF = 100000000;
struct Edge {
int to, from;
ll cost;
Edge(int from, int to, ll cost): from(from), to(to), cost(cost) {}
};
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) { }
bool unionSet(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool findSet(int x, int y) {
return root(x) == root(y);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) {
return -data[root(x)];
}
};
typedef vector<vector<Edge>> AdjList;
AdjList graph;
ll mod_pow(ll x, ll n, ll mod){
ll res = 1;
bool c = false;
while(n){
if(n&1) res = res * x;
if(res > mod){
c = true;
res %= mod;
}
x = x * x %mod;
n >>= 1;
}
if(c) return mod;
return res;
}
#define SIEVE_SIZE 10000+10
bool sieve[SIEVE_SIZE];
void make_sieve(){
for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;
sieve[0] = sieve[1] = false;
for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;
}
bool isprime(ll n){
for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;
return true;
}
template<typename T>
vector<T> gauss_jordan(const vector<vector<T>>& A, const vector<T>& b){
int n = A.size();
vector<vector<T>> B(n, vector<T>(n+1));
for(int i=0; i<n; ++i){
for(int j=0; j<n; ++j){
B[i][j] = A[i][j];
}
}
for(int i=0; i<n; ++i) B[i][n] = b[i];
for(int i=0; i<n; ++i){
int pivot = i;
for(int j=i; j<n; ++j){
if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;
}
swap(B[i], B[pivot]);
if(abs(B[i][i]) < EPS) return vector<T>(); //解なし
for(int j=i+1; j<=n; ++j) B[i][j] /= B[i][i];
for(int j=0; j<n; ++j){
if(i != j){
for(int k=i+1; k<=n; ++k) B[j][k] -= B[i][j] * B[i][k];
}
}
}
vector<T> x(n);
for(int i=0; i<n; ++i) x[i] = B[i][n];
return x;
}
ll GCD(ll a, ll b){
if(a<b) swap(a,b);
if(b == 0) return a;
return GCD(b, a%b);
}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for(int i=0; i<A.size(); ++i){
for(int k=0; k<B.size(); ++k){
for(int j=0; j<B[0].size(); ++j){
C[i][j] = (C[i][j] + A[i][k] * B[k][j] %MOD) % MOD;
}
}
}
return C;
}
mat mat_pow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for(int i=0; i<A.size(); ++i){
B[i][i] = 1;
}
while(n > 0) {
if(n & 1) B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
bool operator<(const pii& a, const pii& b){
if(a.first == b.first) return a.second < b.second;
return a.first < b.first;
}
ll arr[100010];
bool c[100010];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;cin>>n;
set<int> st;
REP(i,n){
cin >> arr[i];
c[i] = true;
}
sort(arr, arr+n);
for(int i=0; i<n; i++){
if(c[i] == false) continue;
ll t = arr[i];
while(t <= 1e9){
t *= 2;
auto it = lower_bound(arr, arr+n, t) - arr;
if(arr[it] == t){
c[it] = false;
}
}
}
int cnt=0;
for(int i=0; i<n; i++){
if(c[i]) cnt++;
}
cout << cnt << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 高橋くんと魔法の箱 |
User |
hamray |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
6073 Byte |
Status |
AC |
Exec Time |
53 ms |
Memory |
1152 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
All |
Score / Max Score |
0 / 0 |
20 / 20 |
30 / 30 |
50 / 50 |
Status |
|
|
|
|
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 |
1 ms |
256 KB |
subtask0_1.txt |
AC |
1 ms |
256 KB |
subtask0_2.txt |
AC |
1 ms |
256 KB |
subtask1_0.txt |
AC |
3 ms |
256 KB |
subtask1_1.txt |
AC |
2 ms |
256 KB |
subtask1_10.txt |
AC |
3 ms |
256 KB |
subtask1_11.txt |
AC |
2 ms |
256 KB |
subtask1_12.txt |
AC |
2 ms |
256 KB |
subtask1_13.txt |
AC |
2 ms |
256 KB |
subtask1_14.txt |
AC |
2 ms |
256 KB |
subtask1_15.txt |
AC |
2 ms |
256 KB |
subtask1_16.txt |
AC |
2 ms |
256 KB |
subtask1_17.txt |
AC |
2 ms |
256 KB |
subtask1_18.txt |
AC |
2 ms |
256 KB |
subtask1_19.txt |
AC |
2 ms |
256 KB |
subtask1_2.txt |
AC |
2 ms |
256 KB |
subtask1_3.txt |
AC |
2 ms |
256 KB |
subtask1_4.txt |
AC |
2 ms |
256 KB |
subtask1_5.txt |
AC |
2 ms |
256 KB |
subtask1_6.txt |
AC |
2 ms |
256 KB |
subtask1_7.txt |
AC |
2 ms |
256 KB |
subtask1_8.txt |
AC |
2 ms |
256 KB |
subtask1_9.txt |
AC |
2 ms |
256 KB |
subtask2_0.txt |
AC |
53 ms |
1152 KB |
subtask2_1.txt |
AC |
49 ms |
1152 KB |
subtask2_2.txt |
AC |
49 ms |
1152 KB |
subtask2_3.txt |
AC |
49 ms |
1152 KB |
subtask2_4.txt |
AC |
49 ms |
1152 KB |
subtask2_5.txt |
AC |
49 ms |
1152 KB |
subtask2_6.txt |
AC |
49 ms |
1152 KB |
subtask2_7.txt |
AC |
49 ms |
1152 KB |
subtask2_8.txt |
AC |
49 ms |
1152 KB |
subtask2_9.txt |
AC |
49 ms |
1152 KB |
subtask3_0.txt |
AC |
53 ms |
1152 KB |
subtask3_1.txt |
AC |
27 ms |
1152 KB |
subtask3_2.txt |
AC |
27 ms |
1152 KB |
subtask3_3.txt |
AC |
27 ms |
1152 KB |
subtask3_4.txt |
AC |
27 ms |
1152 KB |
subtask3_5.txt |
AC |
27 ms |
1152 KB |
subtask3_6.txt |
AC |
27 ms |
1152 KB |
subtask3_7.txt |
AC |
27 ms |
1152 KB |
subtask3_8.txt |
AC |
27 ms |
1152 KB |
subtask3_9.txt |
AC |
27 ms |
1152 KB |