oj.uz

Submission #292910

# Submission time Handle Problem Language Result Execution time Memory
292910 2020-09-07T14:46:00 Z 문홍윤(#5817) Express 20/19 (ROI19_express) C++17
67 / 100
 5000 ms 1048580 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(all(x))
#define press(x) x.erase(unique(all(x)), x.end());
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
typedef pair<LL, LL> pll;
const int INF=1e9;
const LL LLINF=4e16;

int n, m, q, indeg[500010];
int topo[500010], re, fr;
LL p;

vector<pil> link[500010], rlink[500010];
vector<LL> dp[500010];
char str[500010];

void cl(int num, int qu){
    re=fr=0;
    for(int i=1; i<=num; i++){
        vector<pil>().swap(link[i]);
        vector<pil>().swap(rlink[i]);
        vector<LL>().swap(dp[i]);
    }
    for(int i=1; i<=qu; i++)str[i]=0;
}

void merge_dp(int num){
    int sz=rlink[num].size();
    LL st=0;
    vector<int> pv(sz);
    vector<LL> tmp;
    while(1){
        LL minn=LLINF;
        int minnum=-1;
        for(int i=0; i<pv.size(); i++){
            int nw=rlink[num][i].F;
            LL c=rlink[num][i].S;
            if(pv[i]==dp[nw].size())continue;
            if(minn>dp[nw][pv[i]]+c){
                minn=dp[nw][pv[i]]+c;
                minnum=i;
            }
        }
        if(minnum==-1)break;
        if(st*p/(p-1)<minn){
            tmp.eb(minn);
            tmp.eb(minn);
            st=minn;
        }
        else tmp[tmp.size()-1]=minn;
        pv[minnum]++;
    }
    press(tmp);
    dp[num].resize(tmp.size());
    for(int i=0; i<tmp.size(); i++)dp[num][i]=tmp[i];
}

void solve(){
    scanf("%d %d %d %lld", &n, &m, &q, &p);
    for(int i=1; i<=m; i++){
        int a, b; LL c;
        scanf("%d %d %lld", &a, &b, &c);
        link[a].eb(b, c);
        rlink[b].eb(a, c);
        indeg[b]++;
    }
    for(int i=1; i<=n; i++){
        if(!indeg[i])topo[++re]=i;
    }
    for(fr=1; fr<=re; fr++){
        for(auto i:link[topo[fr]]){
            indeg[i.F]--;
            if(!indeg[i.F])topo[++re]=i.F;
        }
    }
    dp[1].eb(0);
    for(int i=2; i<=n; i++)merge_dp(topo[i]);
    for(int i=1; i<=q; i++){
        int a; LL s, e;
        scanf("%d %lld", &a, &s);
        e=s*p/(p-1);
        int num=upper_bound(all(dp[a]), e)-lower_bound(all(dp[a]), s);
        if(num)str[i]='1';
        else str[i]='0';
    }
    printf("%s\n", str+1);
    cl(n, q);
}

int main(){
    int t;
    scanf("%d", &t);
    while(t--)solve();
}

Compilation message

express.cpp: In function 'void merge_dp(int)':
express.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for(int i=0; i<pv.size(); i++){
      |                      ~^~~~~~~~~~
express.cpp:47:21: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             if(pv[i]==dp[nw].size())continue;
express.cpp:64:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i=0; i<tmp.size(); i++)dp[num][i]=tmp[i];
      |                  ~^~~~~~~~~~~
express.cpp: In function 'void solve()':
express.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   68 |     scanf("%d %d %d %lld", &n, &m, &q, &p);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
express.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   71 |         scanf("%d %d %lld", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
express.cpp:89:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   89 |         scanf("%d %lld", &a, &s);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
express.cpp: In function 'int main()':
express.cpp:101:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  101 |     scanf("%d", &t);
      |     ~~~~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 25 ms 35584 KB Output is correct
3 Correct 24 ms 35584 KB Output is correct
4 Correct 24 ms 35584 KB Output is correct
5 Correct 32 ms 35584 KB Output is correct
6 Correct 24 ms 35584 KB Output is correct
7 Correct 24 ms 35584 KB Output is correct
8 Correct 25 ms 35584 KB Output is correct
9 Correct 25 ms 35576 KB Output is correct
10 Correct 24 ms 35576 KB Output is correct
11 Correct 25 ms 35576 KB Output is correct
12 Correct 36 ms 35584 KB Output is correct
13 Correct 35 ms 35584 KB Output is correct
14 Correct 37 ms 35584 KB Output is correct
15 Correct 33 ms 35584 KB Output is correct
16 Correct 34 ms 35584 KB Output is correct
17 Correct 34 ms 35584 KB Output is correct
18 Correct 36 ms 35584 KB Output is correct
19 Correct 35 ms 35584 KB Output is correct
20 Correct 34 ms 35584 KB Output is correct
21 Correct 34 ms 35584 KB Output is correct
22 Correct 34 ms 35584 KB Output is correct
23 Correct 33 ms 35584 KB Output is correct
24 Correct 33 ms 35584 KB Output is correct
25 Correct 31 ms 35584 KB Output is correct
26 Correct 31 ms 35584 KB Output is correct
27 Correct 31 ms 35584 KB Output is correct
28 Correct 32 ms 35584 KB Output is correct
29 Correct 32 ms 35584 KB Output is correct
30 Correct 33 ms 35584 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 24 ms 35576 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 25 ms 35584 KB Output is correct
6 Correct 24 ms 35584 KB Output is correct
7 Correct 25 ms 35576 KB Output is correct
8 Correct 24 ms 35584 KB Output is correct
9 Correct 25 ms 35584 KB Output is correct
10 Correct 29 ms 35712 KB Output is correct
11 Correct 42 ms 36088 KB Output is correct
12 Correct 29 ms 35968 KB Output is correct
13 Correct 34 ms 36096 KB Output is correct
14 Correct 29 ms 35584 KB Output is correct
15 Correct 28 ms 35584 KB Output is correct
16 Correct 28 ms 35584 KB Output is correct
17 Correct 30 ms 35576 KB Output is correct
18 Correct 29 ms 35584 KB Output is correct
19 Correct 30 ms 35584 KB Output is correct
20 Correct 28 ms 35584 KB Output is correct
21 Correct 29 ms 35576 KB Output is correct
22 Correct 29 ms 35968 KB Output is correct
23 Correct 32 ms 35968 KB Output is correct
24 Correct 29 ms 35584 KB Output is correct
25 Correct 29 ms 35576 KB Output is correct
26 Correct 31 ms 35584 KB Output is correct
27 Correct 29 ms 35584 KB Output is correct
28 Correct 27 ms 35584 KB Output is correct
29 Correct 28 ms 35584 KB Output is correct
30 Correct 26 ms 35584 KB Output is correct
31 Correct 27 ms 35584 KB Output is correct
32 Correct 921 ms 38592 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 727 ms 73104 KB Output is correct
3 Correct 571 ms 43256 KB Output is correct
4 Correct 499 ms 39416 KB Output is correct
5 Correct 403 ms 36600 KB Output is correct
6 Correct 623 ms 47948 KB Output is correct
7 Correct 521 ms 42068 KB Output is correct
8 Correct 609 ms 47992 KB Output is correct
9 Correct 535 ms 41976 KB Output is correct
10 Correct 569 ms 47740 KB Output is correct
11 Correct 498 ms 41724 KB Output is correct
12 Correct 141 ms 35712 KB Output is correct
13 Correct 33 ms 35584 KB Output is correct
14 Correct 32 ms 35660 KB Output is correct
15 Correct 36 ms 35584 KB Output is correct
16 Correct 35 ms 35584 KB Output is correct
17 Correct 53 ms 35704 KB Output is correct
18 Correct 184 ms 36472 KB Output is correct
19 Correct 51 ms 35584 KB Output is correct
20 Correct 69 ms 35584 KB Output is correct
21 Correct 70 ms 35584 KB Output is correct
22 Correct 70 ms 35584 KB Output is correct
23 Correct 402 ms 90944 KB Output is correct
24 Correct 1088 ms 183928 KB Output is correct

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 727 ms 73104 KB Output is correct
3 Correct 571 ms 43256 KB Output is correct
4 Correct 499 ms 39416 KB Output is correct
5 Correct 403 ms 36600 KB Output is correct
6 Correct 623 ms 47948 KB Output is correct
7 Correct 521 ms 42068 KB Output is correct
8 Correct 609 ms 47992 KB Output is correct
9 Correct 535 ms 41976 KB Output is correct
10 Correct 569 ms 47740 KB Output is correct
11 Correct 498 ms 41724 KB Output is correct
12 Correct 141 ms 35712 KB Output is correct
13 Correct 33 ms 35584 KB Output is correct
14 Correct 32 ms 35660 KB Output is correct
15 Correct 36 ms 35584 KB Output is correct
16 Correct 35 ms 35584 KB Output is correct
17 Correct 53 ms 35704 KB Output is correct
18 Correct 184 ms 36472 KB Output is correct
19 Correct 51 ms 35584 KB Output is correct
20 Correct 69 ms 35584 KB Output is correct
21 Correct 70 ms 35584 KB Output is correct
22 Correct 70 ms 35584 KB Output is correct
23 Correct 402 ms 90944 KB Output is correct
24 Correct 1088 ms 183928 KB Output is correct
25 Correct 989 ms 75848 KB Output is correct
26 Correct 1092 ms 51676 KB Output is correct
27 Correct 997 ms 43868 KB Output is correct
28 Correct 912 ms 37912 KB Output is correct
29 Correct 709 ms 36348 KB Output is correct
30 Correct 765 ms 37176 KB Output is correct
31 Correct 856 ms 58964 KB Output is correct
32 Correct 768 ms 47480 KB Output is correct
33 Correct 674 ms 50552 KB Output is correct
34 Correct 587 ms 43000 KB Output is correct
35 Correct 781 ms 59000 KB Output is correct
36 Correct 703 ms 47324 KB Output is correct
37 Correct 238 ms 35840 KB Output is correct
38 Correct 37 ms 35584 KB Output is correct
39 Correct 37 ms 36096 KB Output is correct
40 Runtime error 4965 ms 1048580 KB Execution killed with signal 9
41 Halted 0 ms 0 KB -

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 29 ms 35712 KB Output is correct
5 Correct 25 ms 35584 KB Output is correct
6 Correct 27 ms 35584 KB Output is correct
7 Correct 25 ms 35584 KB Output is correct
8 Correct 29 ms 36568 KB Output is correct
9 Correct 27 ms 35576 KB Output is correct
10 Correct 26 ms 35584 KB Output is correct
11 Correct 28 ms 35584 KB Output is correct
12 Correct 27 ms 35584 KB Output is correct
13 Correct 29 ms 35584 KB Output is correct
14 Correct 28 ms 35584 KB Output is correct
15 Correct 28 ms 35712 KB Output is correct
16 Correct 26 ms 35712 KB Output is correct
17 Correct 30 ms 35712 KB Output is correct
18 Correct 30 ms 36224 KB Output is correct
19 Correct 26 ms 35704 KB Output is correct
20 Correct 31 ms 36216 KB Output is correct
21 Correct 31 ms 36344 KB Output is correct
22 Correct 28 ms 35968 KB Output is correct
23 Correct 38 ms 36096 KB Output is correct
24 Correct 29 ms 35968 KB Output is correct
25 Correct 33 ms 36480 KB Output is correct
26 Correct 25 ms 35584 KB Output is correct
27 Correct 29 ms 35584 KB Output is correct
28 Correct 25 ms 35584 KB Output is correct
29 Correct 25 ms 35576 KB Output is correct
30 Correct 31 ms 35584 KB Output is correct
31 Correct 25 ms 35576 KB Output is correct
32 Correct 27 ms 35584 KB Output is correct
33 Correct 26 ms 35584 KB Output is correct
34 Correct 27 ms 35584 KB Output is correct
35 Correct 28 ms 35584 KB Output is correct
36 Correct 30 ms 35584 KB Output is correct
37 Correct 30 ms 35620 KB Output is correct
38 Correct 27 ms 35616 KB Output is correct
39 Correct 28 ms 35584 KB Output is correct
40 Correct 29 ms 35584 KB Output is correct
41 Correct 27 ms 35584 KB Output is correct
42 Correct 27 ms 35576 KB Output is correct
43 Correct 42 ms 38272 KB Output is correct
44 Correct 41 ms 38392 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 35584 KB Output is correct
2 Correct 24 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 29 ms 35712 KB Output is correct
5 Correct 25 ms 35584 KB Output is correct
6 Correct 27 ms 35584 KB Output is correct
7 Correct 25 ms 35584 KB Output is correct
8 Correct 29 ms 36568 KB Output is correct
9 Correct 27 ms 35576 KB Output is correct
10 Correct 26 ms 35584 KB Output is correct
11 Correct 28 ms 35584 KB Output is correct
12 Correct 27 ms 35584 KB Output is correct
13 Correct 29 ms 35584 KB Output is correct
14 Correct 28 ms 35584 KB Output is correct
15 Correct 28 ms 35712 KB Output is correct
16 Correct 26 ms 35712 KB Output is correct
17 Correct 30 ms 35712 KB Output is correct
18 Correct 30 ms 36224 KB Output is correct
19 Correct 26 ms 35704 KB Output is correct
20 Correct 31 ms 36216 KB Output is correct
21 Correct 31 ms 36344 KB Output is correct
22 Correct 28 ms 35968 KB Output is correct
23 Correct 38 ms 36096 KB Output is correct
24 Correct 29 ms 35968 KB Output is correct
25 Correct 33 ms 36480 KB Output is correct
26 Correct 25 ms 35584 KB Output is correct
27 Correct 29 ms 35584 KB Output is correct
28 Correct 25 ms 35584 KB Output is correct
29 Correct 25 ms 35576 KB Output is correct
30 Correct 31 ms 35584 KB Output is correct
31 Correct 25 ms 35576 KB Output is correct
32 Correct 27 ms 35584 KB Output is correct
33 Correct 26 ms 35584 KB Output is correct
34 Correct 27 ms 35584 KB Output is correct
35 Correct 28 ms 35584 KB Output is correct
36 Correct 30 ms 35584 KB Output is correct
37 Correct 30 ms 35620 KB Output is correct
38 Correct 27 ms 35616 KB Output is correct
39 Correct 28 ms 35584 KB Output is correct
40 Correct 29 ms 35584 KB Output is correct
41 Correct 27 ms 35584 KB Output is correct
42 Correct 27 ms 35576 KB Output is correct
43 Correct 42 ms 38272 KB Output is correct
44 Correct 41 ms 38392 KB Output is correct
45 Correct 1000 ms 44960 KB Output is correct
46 Correct 3047 ms 89452 KB Output is correct
47 Correct 1429 ms 79700 KB Output is correct
48 Correct 941 ms 36760 KB Output is correct
49 Correct 1048 ms 36780 KB Output is correct
50 Correct 734 ms 36192 KB Output is correct
51 Correct 26 ms 35584 KB Output is correct
52 Correct 26 ms 35616 KB Output is correct
53 Correct 65 ms 35584 KB Output is correct
54 Correct 43 ms 35584 KB Output is correct
55 Correct 603 ms 36360 KB Output is correct
56 Correct 1563 ms 36692 KB Output is correct
57 Correct 873 ms 36556 KB Output is correct
58 Correct 716 ms 36688 KB Output is correct
59 Correct 1341 ms 36852 KB Output is correct
60 Correct 585 ms 37880 KB Output is correct
61 Correct 1421 ms 55056 KB Output is correct
62 Execution timed out 5100 ms 57720 KB Time limit exceeded
63 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 25 ms 35584 KB Output is correct
3 Correct 24 ms 35584 KB Output is correct
4 Correct 24 ms 35584 KB Output is correct
5 Correct 32 ms 35584 KB Output is correct
6 Correct 24 ms 35584 KB Output is correct
7 Correct 24 ms 35584 KB Output is correct
8 Correct 25 ms 35584 KB Output is correct
9 Correct 25 ms 35576 KB Output is correct
10 Correct 24 ms 35576 KB Output is correct
11 Correct 25 ms 35576 KB Output is correct
12 Correct 36 ms 35584 KB Output is correct
13 Correct 35 ms 35584 KB Output is correct
14 Correct 37 ms 35584 KB Output is correct
15 Correct 33 ms 35584 KB Output is correct
16 Correct 34 ms 35584 KB Output is correct
17 Correct 34 ms 35584 KB Output is correct
18 Correct 36 ms 35584 KB Output is correct
19 Correct 35 ms 35584 KB Output is correct
20 Correct 34 ms 35584 KB Output is correct
21 Correct 34 ms 35584 KB Output is correct
22 Correct 34 ms 35584 KB Output is correct
23 Correct 33 ms 35584 KB Output is correct
24 Correct 33 ms 35584 KB Output is correct
25 Correct 31 ms 35584 KB Output is correct
26 Correct 31 ms 35584 KB Output is correct
27 Correct 31 ms 35584 KB Output is correct
28 Correct 32 ms 35584 KB Output is correct
29 Correct 32 ms 35584 KB Output is correct
30 Correct 33 ms 35584 KB Output is correct
31 Correct 24 ms 35584 KB Output is correct
32 Correct 24 ms 35584 KB Output is correct
33 Correct 24 ms 35576 KB Output is correct
34 Correct 25 ms 35584 KB Output is correct
35 Correct 25 ms 35584 KB Output is correct
36 Correct 24 ms 35584 KB Output is correct
37 Correct 25 ms 35576 KB Output is correct
38 Correct 24 ms 35584 KB Output is correct
39 Correct 25 ms 35584 KB Output is correct
40 Correct 29 ms 35712 KB Output is correct
41 Correct 42 ms 36088 KB Output is correct
42 Correct 29 ms 35968 KB Output is correct
43 Correct 34 ms 36096 KB Output is correct
44 Correct 29 ms 35584 KB Output is correct
45 Correct 28 ms 35584 KB Output is correct
46 Correct 28 ms 35584 KB Output is correct
47 Correct 30 ms 35576 KB Output is correct
48 Correct 29 ms 35584 KB Output is correct
49 Correct 30 ms 35584 KB Output is correct
50 Correct 28 ms 35584 KB Output is correct
51 Correct 29 ms 35576 KB Output is correct
52 Correct 29 ms 35968 KB Output is correct
53 Correct 32 ms 35968 KB Output is correct
54 Correct 29 ms 35584 KB Output is correct
55 Correct 29 ms 35576 KB Output is correct
56 Correct 31 ms 35584 KB Output is correct
57 Correct 29 ms 35584 KB Output is correct
58 Correct 27 ms 35584 KB Output is correct
59 Correct 28 ms 35584 KB Output is correct
60 Correct 26 ms 35584 KB Output is correct
61 Correct 27 ms 35584 KB Output is correct
62 Correct 921 ms 38592 KB Output is correct
63 Correct 25 ms 35584 KB Output is correct
64 Correct 727 ms 73104 KB Output is correct
65 Correct 571 ms 43256 KB Output is correct
66 Correct 499 ms 39416 KB Output is correct
67 Correct 403 ms 36600 KB Output is correct
68 Correct 623 ms 47948 KB Output is correct
69 Correct 521 ms 42068 KB Output is correct
70 Correct 609 ms 47992 KB Output is correct
71 Correct 535 ms 41976 KB Output is correct
72 Correct 569 ms 47740 KB Output is correct
73 Correct 498 ms 41724 KB Output is correct
74 Correct 141 ms 35712 KB Output is correct
75 Correct 33 ms 35584 KB Output is correct
76 Correct 32 ms 35660 KB Output is correct
77 Correct 36 ms 35584 KB Output is correct
78 Correct 35 ms 35584 KB Output is correct
79 Correct 53 ms 35704 KB Output is correct
80 Correct 184 ms 36472 KB Output is correct
81 Correct 51 ms 35584 KB Output is correct
82 Correct 69 ms 35584 KB Output is correct
83 Correct 70 ms 35584 KB Output is correct
84 Correct 70 ms 35584 KB Output is correct
85 Correct 402 ms 90944 KB Output is correct
86 Correct 1088 ms 183928 KB Output is correct
87 Correct 989 ms 75848 KB Output is correct
88 Correct 1092 ms 51676 KB Output is correct
89 Correct 997 ms 43868 KB Output is correct
90 Correct 912 ms 37912 KB Output is correct
91 Correct 709 ms 36348 KB Output is correct
92 Correct 765 ms 37176 KB Output is correct
93 Correct 856 ms 58964 KB Output is correct
94 Correct 768 ms 47480 KB Output is correct
95 Correct 674 ms 50552 KB Output is correct
96 Correct 587 ms 43000 KB Output is correct
97 Correct 781 ms 59000 KB Output is correct
98 Correct 703 ms 47324 KB Output is correct
99 Correct 238 ms 35840 KB Output is correct
100 Correct 37 ms 35584 KB Output is correct
101 Correct 37 ms 36096 KB Output is correct
102 Runtime error 4965 ms 1048580 KB Execution killed with signal 9
103 Halted 0 ms 0 KB -