# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31155 | pasa3232 | Dreaming (IOI13_dreaming) | C++14 | 123 ms | 16344 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>
#include "dreaming.h"
using namespace std;
const int INF=1987654321;
int n, m, l, cnt, ch[100010], M[2][100010], D[100010], A[100010];
struct C{
int r, l;
bool operator<(const C &a)const{
return a.r>r;
}
}data[100010];
vector<pair<int, int> > v[100010];
void dfs(int x){
ch[x]=1;
for(int i=0; i<v[x].size(); i++){
int u=v[x][i].first;
if(ch[u]==0){
dfs(u);
if(M[0][x]<v[x][i].second+M[0][u]){
M[1][x]=M[0][x];
M[0][x]=v[x][i].second+M[0][u];
}
else if(M[1][x]<v[x][i].second+M[0][u]){
M[1][x]=M[0][u]+v[x][i].second;
}
D[x]=max(D[x], D[u]);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |