# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145335 | SamAnd | Ili (COI17_ili) | C++17 | 1092 ms | 12828 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 m_p make_pair
const int N = 10004;
int n, m;
bitset<N> a[N];
pair<pair<char, int>, pair<char, int> > g[N];
char anss[N], ans[N];
bitset<N> x0;
int main()
{
cin >> n >> m;
cin >> anss;
for (int i = 1; i <= m; ++i)
ans[i] = anss[i - 1];
for (int i = 1; i <= m; ++i)
{
char s1, s2;
int x1, x2;
cin >> s1 >> x1 >> s2 >> x2;
if (s1 == 'c')
a[i] = a[x1];
else
a[i][x1] = 1;
if (s2 == 'c')
a[i] = (a[i] | a[x2]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |