Contest Duration: - (local time) (180 minutes)

Submission #1821377

Source Code Expand

Copy
```#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

int main(){
int n;
cin>>n;
vector<int> v(n);
for(ll i = 0; i < n; i+=5){
vector<int> q(n, 0);
ll s = 0;
for(ll j = 0, t = 1; j < 5 && i+j<n; j++,t*=5){
q[i+j] = t;
s += t*8;
}
cout<<"? ";
rep(j, n) cout<<j<<" "; cout<<endl;
ll r;
cin>>r;
r -= s;
for(ll j = 0; j < 5 && i+j<n; j++){
v[i+j] = r%5%2;
r /= 5;
}
}
rep(i, n) cout<<v[i]<<" "; cout<<endl;
return 0;
}
```

#### Submission Info

Submission Time 2017-12-02 12:19:51+0900 E - Coin Authentication Lepton C++14 (GCC 5.4.1) 0 1586 Byte WA 4 ms 724 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
 WA × 1
 WA × 30
Set Name Test Cases
Sample sample_01.txt
Case Name Status Exec Time Memory
sample_01.txt WA 3 ms 592 KB
subtask_1_1.txt WA 3 ms 720 KB
subtask_1_10.txt WA 3 ms 720 KB
subtask_1_11.txt WA 3 ms 724 KB
subtask_1_12.txt WA 3 ms 724 KB
subtask_1_13.txt WA 3 ms 720 KB
subtask_1_14.txt WA 3 ms 592 KB
subtask_1_15.txt WA 3 ms 720 KB
subtask_1_16.txt WA 3 ms 592 KB
subtask_1_17.txt WA 3 ms 724 KB
subtask_1_18.txt WA 4 ms 592 KB
subtask_1_19.txt WA 4 ms 724 KB
subtask_1_2.txt WA 3 ms 720 KB
subtask_1_20.txt WA 4 ms 724 KB
subtask_1_21.txt WA 4 ms 720 KB
subtask_1_22.txt WA 4 ms 724 KB
subtask_1_23.txt WA 4 ms 724 KB
subtask_1_24.txt WA 4 ms 720 KB
subtask_1_25.txt WA 4 ms 720 KB
subtask_1_26.txt WA 3 ms 712 KB
subtask_1_27.txt WA 4 ms 592 KB
subtask_1_28.txt WA 3 ms 592 KB
subtask_1_29.txt WA 4 ms 720 KB
subtask_1_3.txt WA 3 ms 712 KB
subtask_1_4.txt WA 3 ms 716 KB
subtask_1_5.txt WA 3 ms 724 KB
subtask_1_6.txt WA 3 ms 720 KB
subtask_1_7.txt WA 3 ms 720 KB
subtask_1_8.txt WA 3 ms 588 KB
subtask_1_9.txt WA 3 ms 724 KB