oj.uz

Submission #196869

# Submission time Handle Problem Language Result Execution time Memory
196869 2020-01-17T10:50:23 Z awlintqaa Dreaming (IOI13_dreaming) C++14
0 / 100
 1000 ms 13688 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
#include "dreaming.h"
ll n,m,mx,id,timer=1;
vpll v[100009];
ll done[100009];
ll MN[100009],who[100009];
void fill(ll node){
        done[node]=timer;
        for(auto u:v[node]){
                if(done[u.fi])C;
                fill(u.fi);
        }
}
void MX(ll node,ll p,ll crnt){
        if(crnt>mx)mx=crnt,id=node;
        for(auto u:v[node]){
                if(u.fi==p)C;
                MX(u.fi,node,crnt+u.se);
        }
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
        n=N,m=M;
        for(int i=0;i<m;i++){
                int a=A[i],b=B[i],c=T[i];
                v[a].pb({b,c});
                v[b].pb({a,c});
        }
        for(int i=0;i<n;i++){
                MN[i]=1e9;
                if(done[i])C;
                fill(i);
                timer++;
        }
        for(int i=0;i<n;i++){
                mx=0;
                MX(i,i,0);
                if(MN[done[i]]>mx){
                        MN[done[i]]=mx;
                        who[done[i]]=i;
                }
        }
        vpi all;
        for(int i=1;i<timer;i++){
                all.pb({MN[i],who[i]});
        }
        sort(all.begin(),all.end());
        reverse(all.begin(),all.end());
        for(int i=1;i<all.size();i++){
                ll a=all[0].se,b=all[i].se,c=L;
                v[a].pb({b,c});
                v[b].pb({a,c});
        }
        mx=id=-1;
        MX(0,0,0);
        mx=-1;
        MX(id,id,0);
        return mx;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:74:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=1;i<all.size();i++){
                     ~^~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 9940 KB Output is correct
2 Correct 89 ms 10036 KB Output is correct
3 Correct 80 ms 9936 KB Output is correct
4 Correct 80 ms 10004 KB Output is correct
5 Correct 88 ms 10096 KB Output is correct
6 Correct 88 ms 11588 KB Output is correct
7 Correct 78 ms 10408 KB Output is correct
8 Correct 54 ms 9836 KB Output is correct
9 Correct 49 ms 9836 KB Output is correct
10 Correct 52 ms 10220 KB Output is correct
11 Correct 2 ms 2680 KB Output is correct
12 Correct 28 ms 10472 KB Output is correct
13 Correct 28 ms 10596 KB Output is correct
14 Correct 32 ms 10524 KB Output is correct
15 Correct 35 ms 10732 KB Output is correct
16 Correct 31 ms 10568 KB Output is correct
17 Correct 37 ms 10568 KB Output is correct
18 Correct 29 ms 10472 KB Output is correct
19 Correct 35 ms 10468 KB Output is correct
20 Correct 5 ms 2684 KB Output is correct
21 Incorrect 3 ms 2680 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1028 ms 13688 KB Time limit exceeded
2 Halted 0 ms 0 KB -