oj.uz

답안 #292817

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292817 2020-09-07T13:45:09 Z 문홍윤(#5817) 급행열차 20/19 (ROI19_express) C++17
15 / 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=1e18;

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++){
        link[i].clear();
        rlink[i].clear();
        dp[i].clear();
    }
    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);
    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)dp[num].eb(minn);
        pv[minnum]++;
    }
}

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:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int i=0; i<pv.size(); i++){
      |                      ~^~~~~~~~~~
express.cpp:46: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]
   46 |             if(pv[i]==dp[nw].size())continue;
express.cpp: In function 'void solve()':
express.cpp:59:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   59 |     scanf("%d %d %d %lld", &n, &m, &q, &p);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
express.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |         scanf("%d %d %lld", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
express.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   80 |         scanf("%d %lld", &a, &s);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~
express.cpp: In function 'int main()':
express.cpp:92:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   92 |     scanf("%d", &t);
      |     ~~~~~^~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 35584 KB Output is correct
2 Correct 23 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 24 ms 35584 KB Output is correct
5 Correct 33 ms 35624 KB Output is correct
6 Correct 24 ms 35576 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 24 ms 35584 KB Output is correct
9 Correct 24 ms 35584 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 35648 KB Output is correct
13 Correct 31 ms 35576 KB Output is correct
14 Correct 35 ms 35584 KB Output is correct
15 Correct 35 ms 35584 KB Output is correct
16 Correct 33 ms 35584 KB Output is correct
17 Correct 31 ms 35584 KB Output is correct
18 Correct 32 ms 35584 KB Output is correct
19 Correct 31 ms 35584 KB Output is correct
20 Correct 32 ms 35560 KB Output is correct
21 Correct 32 ms 35584 KB Output is correct
22 Correct 33 ms 35620 KB Output is correct
23 Correct 33 ms 35704 KB Output is correct
24 Correct 33 ms 35584 KB Output is correct
25 Correct 31 ms 35584 KB Output is correct
26 Correct 28 ms 35584 KB Output is correct
27 Correct 32 ms 35576 KB Output is correct
28 Correct 30 ms 35584 KB Output is correct
29 Correct 30 ms 35584 KB Output is correct
30 Correct 32 ms 35560 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 35620 KB Output is correct
2 Correct 23 ms 35584 KB Output is correct
3 Correct 24 ms 35584 KB Output is correct
4 Correct 25 ms 35584 KB Output is correct
5 Correct 27 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 22 ms 35584 KB Output is correct
9 Correct 24 ms 35584 KB Output is correct
10 Correct 27 ms 35712 KB Output is correct
11 Runtime error 3837 ms 1048580 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 35584 KB Output is correct
2 Runtime error 2837 ms 1048580 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 35584 KB Output is correct
2 Runtime error 2837 ms 1048580 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 25 ms 35584 KB Output is correct
3 Correct 26 ms 35584 KB Output is correct
4 Execution timed out 5096 ms 961448 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 35584 KB Output is correct
2 Correct 25 ms 35584 KB Output is correct
3 Correct 26 ms 35584 KB Output is correct
4 Execution timed out 5096 ms 961448 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 35584 KB Output is correct
2 Correct 23 ms 35584 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 24 ms 35584 KB Output is correct
5 Correct 33 ms 35624 KB Output is correct
6 Correct 24 ms 35576 KB Output is correct
7 Correct 27 ms 35584 KB Output is correct
8 Correct 24 ms 35584 KB Output is correct
9 Correct 24 ms 35584 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 35648 KB Output is correct
13 Correct 31 ms 35576 KB Output is correct
14 Correct 35 ms 35584 KB Output is correct
15 Correct 35 ms 35584 KB Output is correct
16 Correct 33 ms 35584 KB Output is correct
17 Correct 31 ms 35584 KB Output is correct
18 Correct 32 ms 35584 KB Output is correct
19 Correct 31 ms 35584 KB Output is correct
20 Correct 32 ms 35560 KB Output is correct
21 Correct 32 ms 35584 KB Output is correct
22 Correct 33 ms 35620 KB Output is correct
23 Correct 33 ms 35704 KB Output is correct
24 Correct 33 ms 35584 KB Output is correct
25 Correct 31 ms 35584 KB Output is correct
26 Correct 28 ms 35584 KB Output is correct
27 Correct 32 ms 35576 KB Output is correct
28 Correct 30 ms 35584 KB Output is correct
29 Correct 30 ms 35584 KB Output is correct
30 Correct 32 ms 35560 KB Output is correct
31 Correct 25 ms 35620 KB Output is correct
32 Correct 23 ms 35584 KB Output is correct
33 Correct 24 ms 35584 KB Output is correct
34 Correct 25 ms 35584 KB Output is correct
35 Correct 27 ms 35584 KB Output is correct
36 Correct 24 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 24 ms 35584 KB Output is correct
40 Correct 27 ms 35712 KB Output is correct
41 Runtime error 3837 ms 1048580 KB Execution killed with signal 9
42 Halted 0 ms 0 KB -