# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232157 | TempoTemp | Ili (COI17_ili) | C++14 | 2289 ms | 888 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.
// I don't know ..
#include<bits/stdc++.h>
using namespace std;
const int N = 20004;
int n, m, A[N], B[N], R[N], F[N];
string S, T;
inline bool Check()
{
for (int i = 1; i <= m; i ++)
F[i] = R[i];
for (int i = 1; i <= n; i ++)
F[i + m] = -1;
for (int i = m; i; i --)
if (F[i] == 0)
{
if (F[A[i]] == 1 || F[B[i]] == 1)
return 0;
F[A[i]] = F[B[i]] = 0;
}
for (int i = 1; i <= m; i ++)
if (F[A[i]] == 0 && F[B[i]] == 0)
{
if (F[i] == 1)
return 0;
F[i] = 0;
}
for (int i = 1; i <= m; i ++)
if (F[A[i]] == 1 || F[B[i]] == 1)
{
if (F[i] == 0)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |