# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
784839 | cadmiumsky | Ancient Books (IOI17_books) | C++17 | 2108 ms | 405860 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>
#define all(x) (x).begin(),(x).end()
using namespace std;
using ll = long long;
using ld = long double;
//#define int ll
#define sz(x) ((int)(x).size())
using pii = pair<int,int>;
using tii = tuple<int,int,int>;
const int nmax = 1e6 + 5, inf = 1e18 + 5;
int n;
namespace G {
vector<vector<pii>> g;
void init(int dim) { g.resize(dim, vector<pii>()); }
int newnode() { g.emplace_back(); return sz(g) - 1; }
void addedge(int x, int y, int z) {
g[x].emplace_back(y, z);
}
namespace AINT {
int aint[(nmax + nmax / 2) * 2];
void init(int node = 1, int cl = 0, int cr = n - 1) {
if(cl == cr) {
aint[node] = cl;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |