# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660672 | 2022-11-22T18:14:26 Z | BidoTeima | Poklon (COCI17_poklon7) | C++17 | 860 ms | 133344 KB |
/* ID: BidoTeima LANG: C++11 TASK: */ #include <bits/stdc++.h> using namespace std; using ll = long long; void moo(string filename); void ACPLS(string str = "") { if(str=="NOF")return; if(str.size()) moo(str); else{ #ifndef ONLINE_JUDGE freopen("output.txt", "w", stdout); freopen("input.txt", "r", stdin); #endif } ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); } void moo(string fileName){ freopen((fileName+".in").c_str(),"r",stdin); freopen((fileName+".out").c_str(),"w",stdout); } #define tc \ int tttttt/*,subtask*/; \ cin >> tttttt/* >> subtask*/; \ while (tttttt--)/*end */ vector<__int128_t>adj[(int)1e6+5]; __int128_t sum[(int)1e6+5]; __int128_t dfs(ll node){ if(node<=0)return -node; __int128_t x = dfs(adj[node][0]); __int128_t y = dfs(adj[node][1]); return sum[node]=x+y+(x>y?x-y:y-x); } int main() { //ACPLS(); int n; cin>>n; for(int i = 1; i <= n; i++){ ll u,v; cin>>u>>v; adj[i].push_back(u); adj[i].push_back(v); } dfs(1); string binary; if(sum[1]==0)binary="0"; else while(sum[1]){ binary.push_back((sum[1]%2)+'0'); sum[1]/=2; } reverse(binary.begin(),binary.end()); cout<<binary; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 23764 KB | Output is correct |
2 | Correct | 14 ms | 23764 KB | Output is correct |
3 | Correct | 12 ms | 23764 KB | Output is correct |
4 | Correct | 12 ms | 23764 KB | Output is correct |
5 | Correct | 12 ms | 23764 KB | Output is correct |
6 | Correct | 12 ms | 23748 KB | Output is correct |
7 | Correct | 14 ms | 23796 KB | Output is correct |
8 | Correct | 12 ms | 23764 KB | Output is correct |
9 | Incorrect | 12 ms | 23732 KB | Output isn't correct |
10 | Correct | 13 ms | 23844 KB | Output is correct |
11 | Incorrect | 19 ms | 24556 KB | Output isn't correct |
12 | Incorrect | 21 ms | 24684 KB | Output isn't correct |
13 | Incorrect | 53 ms | 27964 KB | Output isn't correct |
14 | Incorrect | 84 ms | 32332 KB | Output isn't correct |
15 | Correct | 98 ms | 30096 KB | Output is correct |
16 | Incorrect | 277 ms | 50672 KB | Output isn't correct |
17 | Incorrect | 635 ms | 85356 KB | Output isn't correct |
18 | Incorrect | 650 ms | 87920 KB | Output isn't correct |
19 | Incorrect | 860 ms | 94576 KB | Output isn't correct |
20 | Incorrect | 845 ms | 133344 KB | Output isn't correct |