# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
660666 | 2022-11-22T18:08:02 Z | BidoTeima | Poklon (COCI17_poklon7) | C++17 | 806 ms | 102012 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<ll>adj[(int)1e6+5]; __int128_t sum[(int)1e6+5]; __int128_t dfs(ll node){ if(node<=0)return -node; ll x = dfs(adj[node][0]); ll y = dfs(adj[node][1]); return sum[node]=x+y+abs(x-y); } int main() { //ACPLS(); int n; cin>>n; for(int i = 1; i <= n; i++){ int 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 | 12 ms | 23764 KB | Output is correct |
2 | Correct | 12 ms | 23764 KB | Output is correct |
3 | Correct | 13 ms | 23736 KB | Output is correct |
4 | Correct | 12 ms | 23700 KB | Output is correct |
5 | Correct | 13 ms | 23792 KB | Output is correct |
6 | Correct | 13 ms | 23764 KB | Output is correct |
7 | Correct | 12 ms | 23764 KB | Output is correct |
8 | Correct | 13 ms | 23712 KB | Output is correct |
9 | Incorrect | 13 ms | 23820 KB | Output isn't correct |
10 | Incorrect | 13 ms | 23764 KB | Output isn't correct |
11 | Incorrect | 20 ms | 24276 KB | Output isn't correct |
12 | Incorrect | 21 ms | 24412 KB | Output isn't correct |
13 | Incorrect | 50 ms | 26780 KB | Output isn't correct |
14 | Incorrect | 90 ms | 30004 KB | Output isn't correct |
15 | Incorrect | 89 ms | 28376 KB | Output isn't correct |
16 | Incorrect | 271 ms | 43528 KB | Output isn't correct |
17 | Incorrect | 629 ms | 69052 KB | Output isn't correct |
18 | Incorrect | 637 ms | 70864 KB | Output isn't correct |
19 | Incorrect | 806 ms | 76340 KB | Output isn't correct |
20 | Incorrect | 796 ms | 102012 KB | Output isn't correct |