oj.uz

답안 #411681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
411681 2021-05-25T17:55:57 Z Dormi Travelling Merchant (CCO21_day2problem1) C++14
9 / 25
 2000 ms 32224 KB 
#include <bits/stdc++.h>
#pragma GCC optimize "Ofast"
#pragma GCC optimize "unroll-loops"
#pragma GCC target "sse,sse2,sse3,sse4,abm,avx2,mmx,popcnt"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T>
int sz(const T &a){return int(a.size());}
const int MN=2e5+1;
vector<pair<int,pll>> adj[MN];
bool gone[MN];
ll tried[MN];
ll work[MN];
bool dfs(int loc, ll am){
    if(am<=tried[loc])return false;
    if(am>=work[loc])return true;
    gone[loc]=true;
    for(auto x:adj[loc]){
        if(x.second.first<=am){
            if(gone[x.first]){
                gone[loc]=false;
                work[loc]=am;
                return true;
            }
            if(dfs(x.first,am+x.second.second)){
                gone[loc]=false;
                work[loc]=am;
                return true;
            }
        }
    }
    tried[loc]=am;
    gone[loc]=false;
    return false;
}
int main(int argc, char *argv[]) {
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n,m,a,b;
    cin>>n>>m;
    ll r,p;
    for(int i=0;i<m;i++){
        cin>>a>>b>>r>>p;
        adj[a].push_back({b,{r,p}});
    }
    for(int i=1;i<=n;i++)tried[i]=-1,work[i]=LLONG_MAX;
    for(int i=1;i<=n;i++){
        ll lo=0,hi=1e9;
        while(lo!=hi){
            ll mid=(lo+hi)/2;
            if(dfs(i,mid))hi=mid;
            else lo=mid+1;
        }
        if(lo==1e9)printf("-1%c"," \n"[i==n]);
        else printf("%lli%c",lo," \n"[i==n]);
    }
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5068 KB Output is correct
2 Correct 5 ms 5068 KB Output is correct
3 Correct 5 ms 5068 KB Output is correct
4 Correct 5 ms 5152 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 6 ms 5196 KB Output is correct
9 Correct 6 ms 5068 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 14 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 6 ms 5196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 15364 KB Output is correct
2 Correct 246 ms 15428 KB Output is correct
3 Correct 103 ms 12196 KB Output is correct
4 Correct 60 ms 9292 KB Output is correct
5 Correct 195 ms 14148 KB Output is correct
6 Correct 197 ms 14184 KB Output is correct
7 Correct 86 ms 11588 KB Output is correct
8 Correct 1384 ms 32152 KB Output is correct
9 Correct 361 ms 16364 KB Output is correct
10 Correct 76 ms 10152 KB Output is correct
11 Correct 197 ms 13956 KB Output is correct
12 Correct 66 ms 10720 KB Output is correct
13 Correct 65 ms 10048 KB Output is correct
14 Correct 1402 ms 32160 KB Output is correct
15 Correct 1476 ms 32192 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5068 KB Output is correct
2 Correct 5 ms 5068 KB Output is correct
3 Correct 5 ms 5068 KB Output is correct
4 Correct 5 ms 5152 KB Output is correct
5 Correct 5 ms 5068 KB Output is correct
6 Correct 5 ms 5068 KB Output is correct
7 Correct 5 ms 5068 KB Output is correct
8 Correct 6 ms 5196 KB Output is correct
9 Correct 6 ms 5068 KB Output is correct
10 Correct 5 ms 5068 KB Output is correct
11 Correct 14 ms 5068 KB Output is correct
12 Correct 4 ms 5068 KB Output is correct
13 Correct 4 ms 5068 KB Output is correct
14 Correct 6 ms 5196 KB Output is correct
15 Correct 230 ms 15364 KB Output is correct
16 Correct 246 ms 15428 KB Output is correct
17 Correct 103 ms 12196 KB Output is correct
18 Correct 60 ms 9292 KB Output is correct
19 Correct 195 ms 14148 KB Output is correct
20 Correct 197 ms 14184 KB Output is correct
21 Correct 86 ms 11588 KB Output is correct
22 Correct 1384 ms 32152 KB Output is correct
23 Correct 361 ms 16364 KB Output is correct
24 Correct 76 ms 10152 KB Output is correct
25 Correct 197 ms 13956 KB Output is correct
26 Correct 66 ms 10720 KB Output is correct
27 Correct 65 ms 10048 KB Output is correct
28 Correct 1402 ms 32160 KB Output is correct
29 Correct 1476 ms 32192 KB Output is correct
30 Correct 251 ms 15260 KB Output is correct
31 Correct 227 ms 15288 KB Output is correct
32 Correct 74 ms 12052 KB Output is correct
33 Correct 60 ms 9220 KB Output is correct
34 Correct 193 ms 14212 KB Output is correct
35 Correct 195 ms 14120 KB Output is correct
36 Correct 85 ms 11608 KB Output is correct
37 Correct 1416 ms 32156 KB Output is correct
38 Correct 474 ms 15940 KB Output is correct
39 Correct 79 ms 10112 KB Output is correct
40 Correct 230 ms 14040 KB Output is correct
41 Correct 69 ms 10540 KB Output is correct
42 Correct 66 ms 9932 KB Output is correct
43 Correct 1342 ms 32224 KB Output is correct
44 Correct 1355 ms 32144 KB Output is correct
45 Correct 1307 ms 32220 KB Output is correct
46 Execution timed out 2047 ms 19784 KB Time limit exceeded
47 Halted 0 ms 0 KB -