# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004435 | aykhn | Trobojnica (COCI19_trobojnica) | C++17 | 236 ms | 51752 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 inf 0x3F3F3F3F3F3F3F3F
const int MXN = 20 + 5;
const int mod = 1e9 + 7;
const int LOG = 20;
int n;
vector<array<int, 3>> res;
set<array<int, 3>> s;
queue<array<array<int, 3>, 2>> del[4];
int cnt[4];
int ok()
{
if (s.size() == 3)
{
return cnt[1] == 1 && cnt[2] == 1 && cnt[3] == 1;
}
if (max({cnt[1], cnt[2], cnt[3]}) == s.size())
{
return 0;
}
int mx = 1;
for (int i = 1; i <= 3; i++) if (cnt[i] > cnt[mx]) mx = i;
while (!del[mx].empty())
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |