# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
685640 | Ronin13 | XOR (IZhO12_xor) | C++14 | 482 ms | 115640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
vector <int> trie;
vector <vector <int> > children;
vector <int> dp;
int cur = 0;
int make_node(){
trie.pb(cur);
vector <int> vv;
vv.assign(2, -1);
children.pb(vv);
dp.pb(1e9 + 1);
return cur++;
}
int add(bitset <31> bt, int i, int cur, int j){
if(j == -1){
dp[cur] = min(dp[cur], i);
return dp[cur];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |