# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
543674 | 2022-03-31T08:13:49 Z | Sho10 | Data Transfer (IOI19_transfer) | C++17 | 117 ms | 2496 KB |
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; vector<int> get_attachment(vector<int>source){ ll xr=0,cnt=0; for(ll i=0;i<source.size();i++) { if(source[i]==1){ xr^=(i+1); cnt++; } } vector<int>g; g.pb(cnt%2); if(source.size()==255){ for(int i=0;i<=7;i++) { if((1ll<<i)&xr){ g.pb(1); }else g.pb(0); } } return g; } vector<int> retrieve(vector<int>data){ if(data.size()>=200){ ll x=data[255]; ll cnt=0; ll xr=0; for(ll i=0;i<255;i++) { if(data[i]==1){ cnt++; xr^=(i+1); } } vector<int>res; if(cnt%2==x){ for(ll i=0;i<255;i++) { res.pb(data[i]); } return res; } for(ll i=256;i<data.size();i++) { if(data[i]==1){ xr^=(1ll<<(i-256)); } } if(xr==0){ for(ll i=0;i<255;i++) { res.pb(data[i]); } return res; } for(ll i=0;i<255;i++) { res.pb(data[i]); } res[xr-1]^=1; return res; } } /* int32_t main(){ CODE_START; #ifdef LOCAL ifstream cin("input.txt"); #endif */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 640 KB | WA in grader: wrong source retrieval |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 78 ms | 2492 KB | Output is correct |
2 | Correct | 80 ms | 2484 KB | Output is correct |
3 | Correct | 117 ms | 2488 KB | Output is correct |
4 | Correct | 107 ms | 2484 KB | Output is correct |
5 | Correct | 93 ms | 2484 KB | Output is correct |
6 | Correct | 93 ms | 2484 KB | Output is correct |
7 | Correct | 111 ms | 2492 KB | Output is correct |
8 | Correct | 87 ms | 2492 KB | Output is correct |
9 | Correct | 76 ms | 2496 KB | Output is correct |
10 | Correct | 77 ms | 2484 KB | Output is correct |
11 | Correct | 84 ms | 2496 KB | Output is correct |
12 | Correct | 79 ms | 2492 KB | Output is correct |
13 | Correct | 95 ms | 2484 KB | Output is correct |
14 | Correct | 82 ms | 2484 KB | Output is correct |
15 | Correct | 79 ms | 2492 KB | Output is correct |
16 | Correct | 84 ms | 2488 KB | Output is correct |
17 | Correct | 85 ms | 2492 KB | Output is correct |
18 | Correct | 84 ms | 2492 KB | Output is correct |
19 | Correct | 109 ms | 2484 KB | Output is correct |