답안 #292907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
292907	2020-09-07T14:44:36 Z	문홍윤(#5817)	급행열차 20/19 (ROI19_express)	C++17	67 / 100	5000 ms	183512 KB

express

#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=1e16;

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

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	35584 KB	Output is correct
2	Correct	24 ms	35576 KB	Output is correct
3	Correct	25 ms	35584 KB	Output is correct
4	Correct	24 ms	35584 KB	Output is correct
5	Correct	31 ms	35584 KB	Output is correct
6	Correct	24 ms	35584 KB	Output is correct
7	Correct	25 ms	35584 KB	Output is correct
8	Correct	24 ms	35584 KB	Output is correct
9	Correct	25 ms	35576 KB	Output is correct
10	Correct	24 ms	35584 KB	Output is correct
11	Correct	24 ms	35584 KB	Output is correct
12	Correct	35 ms	35624 KB	Output is correct
13	Correct	39 ms	35584 KB	Output is correct
14	Correct	35 ms	35624 KB	Output is correct
15	Correct	33 ms	35584 KB	Output is correct
16	Correct	33 ms	35584 KB	Output is correct
17	Correct	33 ms	35576 KB	Output is correct
18	Correct	36 ms	35584 KB	Output is correct
19	Correct	36 ms	35584 KB	Output is correct
20	Correct	35 ms	35584 KB	Output is correct
21	Correct	37 ms	35584 KB	Output is correct
22	Correct	33 ms	35628 KB	Output is correct
23	Correct	33 ms	35584 KB	Output is correct
24	Correct	31 ms	35584 KB	Output is correct
25	Correct	34 ms	35704 KB	Output is correct
26	Correct	33 ms	35584 KB	Output is correct
27	Correct	33 ms	35584 KB	Output is correct
28	Correct	31 ms	35576 KB	Output is correct
29	Correct	33 ms	35584 KB	Output is correct
30	Correct	31 ms	35584 KB	Output is correct

Subtask #2
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	24 ms	35584 KB	Output is correct
2	Correct	23 ms	35584 KB	Output is correct
3	Correct	24 ms	35584 KB	Output is correct
4	Correct	23 ms	35584 KB	Output is correct
5	Correct	23 ms	35584 KB	Output is correct
6	Correct	22 ms	35584 KB	Output is correct
7	Correct	24 ms	35584 KB	Output is correct
8	Correct	22 ms	35584 KB	Output is correct
9	Correct	23 ms	35584 KB	Output is correct
10	Correct	29 ms	35712 KB	Output is correct
11	Correct	46 ms	36088 KB	Output is correct
12	Correct	31 ms	35968 KB	Output is correct
13	Correct	35 ms	36000 KB	Output is correct
14	Correct	34 ms	35584 KB	Output is correct
15	Correct	35 ms	35584 KB	Output is correct
16	Correct	30 ms	35584 KB	Output is correct
17	Correct	32 ms	35660 KB	Output is correct
18	Correct	32 ms	35584 KB	Output is correct
19	Correct	30 ms	35584 KB	Output is correct
20	Correct	29 ms	35584 KB	Output is correct
21	Correct	30 ms	35584 KB	Output is correct
22	Correct	30 ms	36096 KB	Output is correct
23	Correct	30 ms	35960 KB	Output is correct
24	Correct	31 ms	35584 KB	Output is correct
25	Correct	29 ms	35584 KB	Output is correct
26	Correct	32 ms	35584 KB	Output is correct
27	Correct	31 ms	35584 KB	Output is correct
28	Correct	28 ms	35584 KB	Output is correct
29	Correct	27 ms	35584 KB	Output is correct
30	Correct	28 ms	35576 KB	Output is correct
31	Correct	27 ms	35616 KB	Output is correct
32	Correct	973 ms	38564 KB	Output is correct

Subtask #3
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	35528 KB	Output is correct
2	Correct	732 ms	71480 KB	Output is correct
3	Correct	596 ms	43128 KB	Output is correct
4	Correct	536 ms	39504 KB	Output is correct
5	Correct	440 ms	36500 KB	Output is correct
6	Correct	656 ms	47792 KB	Output is correct
7	Correct	600 ms	42104 KB	Output is correct
8	Correct	654 ms	47992 KB	Output is correct
9	Correct	563 ms	41848 KB	Output is correct
10	Correct	613 ms	47624 KB	Output is correct
11	Correct	535 ms	41592 KB	Output is correct
12	Correct	145 ms	35712 KB	Output is correct
13	Correct	32 ms	35584 KB	Output is correct
14	Correct	35 ms	35584 KB	Output is correct
15	Correct	35 ms	35704 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	54 ms	35704 KB	Output is correct
18	Correct	176 ms	36364 KB	Output is correct
19	Correct	46 ms	35576 KB	Output is correct
20	Correct	71 ms	35584 KB	Output is correct
21	Correct	70 ms	35584 KB	Output is correct
22	Correct	71 ms	35576 KB	Output is correct
23	Correct	401 ms	91196 KB	Output is correct
24	Correct	1028 ms	183512 KB	Output is correct

Subtask #4
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	35528 KB	Output is correct
2	Correct	732 ms	71480 KB	Output is correct
3	Correct	596 ms	43128 KB	Output is correct
4	Correct	536 ms	39504 KB	Output is correct
5	Correct	440 ms	36500 KB	Output is correct
6	Correct	656 ms	47792 KB	Output is correct
7	Correct	600 ms	42104 KB	Output is correct
8	Correct	654 ms	47992 KB	Output is correct
9	Correct	563 ms	41848 KB	Output is correct
10	Correct	613 ms	47624 KB	Output is correct
11	Correct	535 ms	41592 KB	Output is correct
12	Correct	145 ms	35712 KB	Output is correct
13	Correct	32 ms	35584 KB	Output is correct
14	Correct	35 ms	35584 KB	Output is correct
15	Correct	35 ms	35704 KB	Output is correct
16	Correct	36 ms	35576 KB	Output is correct
17	Correct	54 ms	35704 KB	Output is correct
18	Correct	176 ms	36364 KB	Output is correct
19	Correct	46 ms	35576 KB	Output is correct
20	Correct	71 ms	35584 KB	Output is correct
21	Correct	70 ms	35584 KB	Output is correct
22	Correct	71 ms	35576 KB	Output is correct
23	Correct	401 ms	91196 KB	Output is correct
24	Correct	1028 ms	183512 KB	Output is correct
25	Incorrect	954 ms	74848 KB	Output isn't correct
26	Halted	0 ms	0 KB	-

Subtask #5
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	35584 KB	Output is correct
2	Correct	24 ms	35584 KB	Output is correct
3	Correct	27 ms	35576 KB	Output is correct
4	Correct	30 ms	35712 KB	Output is correct
5	Correct	26 ms	35712 KB	Output is correct
6	Correct	26 ms	35584 KB	Output is correct
7	Correct	26 ms	35584 KB	Output is correct
8	Correct	29 ms	36600 KB	Output is correct
9	Correct	27 ms	35584 KB	Output is correct
10	Correct	27 ms	35576 KB	Output is correct
11	Correct	28 ms	35584 KB	Output is correct
12	Correct	27 ms	35576 KB	Output is correct
13	Correct	28 ms	35584 KB	Output is correct
14	Correct	28 ms	35584 KB	Output is correct
15	Correct	28 ms	35584 KB	Output is correct
16	Correct	28 ms	35712 KB	Output is correct
17	Correct	30 ms	35712 KB	Output is correct
18	Correct	30 ms	36216 KB	Output is correct
19	Correct	26 ms	35712 KB	Output is correct
20	Correct	31 ms	36224 KB	Output is correct
21	Correct	31 ms	36348 KB	Output is correct
22	Correct	28 ms	35960 KB	Output is correct
23	Correct	31 ms	36224 KB	Output is correct
24	Correct	29 ms	35960 KB	Output is correct
25	Correct	32 ms	36480 KB	Output is correct
26	Correct	24 ms	35584 KB	Output is correct
27	Correct	25 ms	35584 KB	Output is correct
28	Correct	25 ms	35584 KB	Output is correct
29	Correct	25 ms	35584 KB	Output is correct
30	Correct	26 ms	35636 KB	Output is correct
31	Correct	25 ms	35576 KB	Output is correct
32	Correct	25 ms	35584 KB	Output is correct
33	Correct	26 ms	35576 KB	Output is correct
34	Correct	28 ms	35616 KB	Output is correct
35	Correct	27 ms	35584 KB	Output is correct
36	Correct	28 ms	35584 KB	Output is correct
37	Correct	27 ms	35584 KB	Output is correct
38	Correct	27 ms	35584 KB	Output is correct
39	Correct	28 ms	35584 KB	Output is correct
40	Correct	27 ms	35584 KB	Output is correct
41	Correct	28 ms	35584 KB	Output is correct
42	Correct	28 ms	35584 KB	Output is correct
43	Correct	39 ms	38264 KB	Output is correct
44	Correct	40 ms	38400 KB	Output is correct

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	26 ms	35584 KB	Output is correct
2	Correct	24 ms	35584 KB	Output is correct
3	Correct	27 ms	35576 KB	Output is correct
4	Correct	30 ms	35712 KB	Output is correct
5	Correct	26 ms	35712 KB	Output is correct
6	Correct	26 ms	35584 KB	Output is correct
7	Correct	26 ms	35584 KB	Output is correct
8	Correct	29 ms	36600 KB	Output is correct
9	Correct	27 ms	35584 KB	Output is correct
10	Correct	27 ms	35576 KB	Output is correct
11	Correct	28 ms	35584 KB	Output is correct
12	Correct	27 ms	35576 KB	Output is correct
13	Correct	28 ms	35584 KB	Output is correct
14	Correct	28 ms	35584 KB	Output is correct
15	Correct	28 ms	35584 KB	Output is correct
16	Correct	28 ms	35712 KB	Output is correct
17	Correct	30 ms	35712 KB	Output is correct
18	Correct	30 ms	36216 KB	Output is correct
19	Correct	26 ms	35712 KB	Output is correct
20	Correct	31 ms	36224 KB	Output is correct
21	Correct	31 ms	36348 KB	Output is correct
22	Correct	28 ms	35960 KB	Output is correct
23	Correct	31 ms	36224 KB	Output is correct
24	Correct	29 ms	35960 KB	Output is correct
25	Correct	32 ms	36480 KB	Output is correct
26	Correct	24 ms	35584 KB	Output is correct
27	Correct	25 ms	35584 KB	Output is correct
28	Correct	25 ms	35584 KB	Output is correct
29	Correct	25 ms	35584 KB	Output is correct
30	Correct	26 ms	35636 KB	Output is correct
31	Correct	25 ms	35576 KB	Output is correct
32	Correct	25 ms	35584 KB	Output is correct
33	Correct	26 ms	35576 KB	Output is correct
34	Correct	28 ms	35616 KB	Output is correct
35	Correct	27 ms	35584 KB	Output is correct
36	Correct	28 ms	35584 KB	Output is correct
37	Correct	27 ms	35584 KB	Output is correct
38	Correct	27 ms	35584 KB	Output is correct
39	Correct	28 ms	35584 KB	Output is correct
40	Correct	27 ms	35584 KB	Output is correct
41	Correct	28 ms	35584 KB	Output is correct
42	Correct	28 ms	35584 KB	Output is correct
43	Correct	39 ms	38264 KB	Output is correct
44	Correct	40 ms	38400 KB	Output is correct
45	Correct	1016 ms	45004 KB	Output is correct
46	Correct	2764 ms	89480 KB	Output is correct
47	Correct	1299 ms	79864 KB	Output is correct
48	Correct	742 ms	36728 KB	Output is correct
49	Correct	1048 ms	36636 KB	Output is correct
50	Correct	721 ms	36216 KB	Output is correct
51	Correct	26 ms	35576 KB	Output is correct
52	Correct	27 ms	35584 KB	Output is correct
53	Correct	62 ms	35580 KB	Output is correct
54	Correct	41 ms	35584 KB	Output is correct
55	Correct	599 ms	36356 KB	Output is correct
56	Correct	1454 ms	36916 KB	Output is correct
57	Correct	877 ms	36356 KB	Output is correct
58	Correct	735 ms	36908 KB	Output is correct
59	Correct	1373 ms	36484 KB	Output is correct
60	Correct	617 ms	37624 KB	Output is correct
61	Correct	1393 ms	54932 KB	Output is correct
62	Execution timed out	5077 ms	57720 KB	Time limit exceeded
63	Halted	0 ms	0 KB	-

Subtask #7
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	25 ms	35584 KB	Output is correct
2	Correct	24 ms	35576 KB	Output is correct
3	Correct	25 ms	35584 KB	Output is correct
4	Correct	24 ms	35584 KB	Output is correct
5	Correct	31 ms	35584 KB	Output is correct
6	Correct	24 ms	35584 KB	Output is correct
7	Correct	25 ms	35584 KB	Output is correct
8	Correct	24 ms	35584 KB	Output is correct
9	Correct	25 ms	35576 KB	Output is correct
10	Correct	24 ms	35584 KB	Output is correct
11	Correct	24 ms	35584 KB	Output is correct
12	Correct	35 ms	35624 KB	Output is correct
13	Correct	39 ms	35584 KB	Output is correct
14	Correct	35 ms	35624 KB	Output is correct
15	Correct	33 ms	35584 KB	Output is correct
16	Correct	33 ms	35584 KB	Output is correct
17	Correct	33 ms	35576 KB	Output is correct
18	Correct	36 ms	35584 KB	Output is correct
19	Correct	36 ms	35584 KB	Output is correct
20	Correct	35 ms	35584 KB	Output is correct
21	Correct	37 ms	35584 KB	Output is correct
22	Correct	33 ms	35628 KB	Output is correct
23	Correct	33 ms	35584 KB	Output is correct
24	Correct	31 ms	35584 KB	Output is correct
25	Correct	34 ms	35704 KB	Output is correct
26	Correct	33 ms	35584 KB	Output is correct
27	Correct	33 ms	35584 KB	Output is correct
28	Correct	31 ms	35576 KB	Output is correct
29	Correct	33 ms	35584 KB	Output is correct
30	Correct	31 ms	35584 KB	Output is correct
31	Correct	24 ms	35584 KB	Output is correct
32	Correct	23 ms	35584 KB	Output is correct
33	Correct	24 ms	35584 KB	Output is correct
34	Correct	23 ms	35584 KB	Output is correct
35	Correct	23 ms	35584 KB	Output is correct
36	Correct	22 ms	35584 KB	Output is correct
37	Correct	24 ms	35584 KB	Output is correct
38	Correct	22 ms	35584 KB	Output is correct
39	Correct	23 ms	35584 KB	Output is correct
40	Correct	29 ms	35712 KB	Output is correct
41	Correct	46 ms	36088 KB	Output is correct
42	Correct	31 ms	35968 KB	Output is correct
43	Correct	35 ms	36000 KB	Output is correct
44	Correct	34 ms	35584 KB	Output is correct
45	Correct	35 ms	35584 KB	Output is correct
46	Correct	30 ms	35584 KB	Output is correct
47	Correct	32 ms	35660 KB	Output is correct
48	Correct	32 ms	35584 KB	Output is correct
49	Correct	30 ms	35584 KB	Output is correct
50	Correct	29 ms	35584 KB	Output is correct
51	Correct	30 ms	35584 KB	Output is correct
52	Correct	30 ms	36096 KB	Output is correct
53	Correct	30 ms	35960 KB	Output is correct
54	Correct	31 ms	35584 KB	Output is correct
55	Correct	29 ms	35584 KB	Output is correct
56	Correct	32 ms	35584 KB	Output is correct
57	Correct	31 ms	35584 KB	Output is correct
58	Correct	28 ms	35584 KB	Output is correct
59	Correct	27 ms	35584 KB	Output is correct
60	Correct	28 ms	35576 KB	Output is correct
61	Correct	27 ms	35616 KB	Output is correct
62	Correct	973 ms	38564 KB	Output is correct
63	Correct	27 ms	35528 KB	Output is correct
64	Correct	732 ms	71480 KB	Output is correct
65	Correct	596 ms	43128 KB	Output is correct
66	Correct	536 ms	39504 KB	Output is correct
67	Correct	440 ms	36500 KB	Output is correct
68	Correct	656 ms	47792 KB	Output is correct
69	Correct	600 ms	42104 KB	Output is correct
70	Correct	654 ms	47992 KB	Output is correct
71	Correct	563 ms	41848 KB	Output is correct
72	Correct	613 ms	47624 KB	Output is correct
73	Correct	535 ms	41592 KB	Output is correct
74	Correct	145 ms	35712 KB	Output is correct
75	Correct	32 ms	35584 KB	Output is correct
76	Correct	35 ms	35584 KB	Output is correct
77	Correct	35 ms	35704 KB	Output is correct
78	Correct	36 ms	35576 KB	Output is correct
79	Correct	54 ms	35704 KB	Output is correct
80	Correct	176 ms	36364 KB	Output is correct
81	Correct	46 ms	35576 KB	Output is correct
82	Correct	71 ms	35584 KB	Output is correct
83	Correct	70 ms	35584 KB	Output is correct
84	Correct	71 ms	35576 KB	Output is correct
85	Correct	401 ms	91196 KB	Output is correct
86	Correct	1028 ms	183512 KB	Output is correct
87	Incorrect	954 ms	74848 KB	Output isn't correct
88	Halted	0 ms	0 KB	-

답안 #292907

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 24.0 / 24.0

Subtask #3 17.0 / 17.0

Subtask #4 0 / 11.0

Subtask #5 11.0 / 11.0

Subtask #6 0 / 11.0

Subtask #7 0 / 11.0

Subtask #1
15.0 / 15.0

Subtask #2
24.0 / 24.0

Subtask #3
17.0 / 17.0

Subtask #4
0 / 11.0

Subtask #5
11.0 / 11.0

Subtask #6
0 / 11.0

Subtask #7
0 / 11.0