# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
797495 | firewater | Ancient Books (IOI17_books) | C++14 | 286 ms | 239068 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 "books.h"
#include <cstdio>
#include <vector>
#include<queue>
#include <cassert>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
#define N 1001000
#define mp make_pair
#define fs first
#define sn second
using namespace std;
ll n,m,w,x,y,s,ans,tot,h[N],b[N],p[N],to[N],mx[N],mi[N],fa[N],fr[N];
priority_queue<pair<ll,ll> >d;
struct rec
{
int to,nx,l;
}e[N<<3];
void dfs(ll x)
{
if(fr[x])return;
fr[x]=w;
mx[w]=max(mx[w],x);
mi[w]=min(mi[w],x);
ans+=abs(x-to[x]);
dfs(to[x]);
# | 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... |