| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 150574 | お前はもう死んでいる (#200) | Lokahian Relics (FXCUP4_lokahia) | C++17 | 7 ms | 640 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 "lokahia.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 205;
int com[N];
int FindBase(int n)
{
fill(com, com + n, -1);
vector<int> s, t;
int la = 0;
for (int i = 0; i < n; i++)
s.push_back(i);
while (s.size() >= 1)
{
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
for (int i = 1; i < s.size(); i += 2)
{
int u = CollectRelics(s[i - 1], s[i]);
if (u != -1)
{
com[s[i] - 1] = com[s[i]] = com[u] = u;
t.push_back(u);
}
}
if (s.size() & 1)
la = s.back();
swap(s, t);
t.clear();
}
int sz = 0;
for (int i = 0; i < n; i++)
if (com[i] == la)
sz++;
else if (com[i] == -1 && CollectRelics(la, i) != -1)
sz++;
return sz > n / 2 ? la : -1;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
