# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545225 | socpite | Ili (COI17_ili) | C++17 | 437 ms | 25260 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>
using namespace std;
#define f first
#define s second
const int maxn = 1e4+5;
pair<int, int> child[maxn][2];
int n, m;
string str;
bitset<maxn> subset[maxn][2];
bitset<maxn> val[2];
bitset<maxn> orval[2];
bitset<maxn> crr;
int ans[maxn];
int main(){
//freopen(".inp", "r", stdin);
cin >> n >> m >> str;
for(int i = 1; i <= m; i++){
char c;
cin >> c;
if(c == 'x')child[i][0].s = 0;
else child[i][0].s = 1;
cin >> child[i][0].f;
cin >> c;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |