oj.uz

Submission #25594

# Submission time Handle Problem Language Result Execution time Memory
25594 2017-06-23T07:04:37 Z 시제연(#1075) 버스 (JOI14_bus) C++
35 / 100
 1000 ms 56356 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int,int> pii;
typedef pair<pii,int> piii;

int n, m, c, q;
vector<pii> lis[600100];
vector<piii> tis[100100];
pii ord[600100];
int dis[600100];
int deg[600100];
int INF = 987654321;

void dijk() {
    int i;
    queue<int> pq;
    for (i=0;i<2*m;i++) dis[i] = INF;
    for (i=0;i<2*m;i++) {
        if (ord[i].first==0) dis[i] = 0;
        if (deg[i]==0) pq.push(i);
    }
    while(!pq.empty()) {
        int here = pq.front();
        pq.pop();
        for (i=0;i<lis[here].size();i++) {
            int there = lis[here][i].second;
            int w = lis[here][i].first;
            if (dis[there]>dis[here]+w) dis[there]=dis[here]+w;
            deg[there]--;
            if (deg[there]==0) pq.push(there);
        }
    }
}

int main() {
    int i, j;

    //freopen("input","r",stdin);

    scanf("%d%d",&n,&m);
    for (i=0;i<m;i++) {
        int a, b, c, d;
        scanf("%d%d%d%d",&a,&b,&c,&d);
        a--;b--;
        tis[a].push_back(piii(pii(c,1),i*2));
        tis[b].push_back(piii(pii(d,0),i*2+1));
        lis[i*2].push_back(pii(d-c,i*2+1));
        ord[i*2] = pii(a,c);
        ord[i*2+1] = pii(b,d);
        deg[i*2+1]++;
    }
    for (i=0;i<n;i++) sort(tis[i].begin(),tis[i].end());
    for (i=1;i<n;i++) {
        for (j=(int)tis[i].size()-1;j>0;j--) {
            lis[tis[i][j-1].second].push_back(pii(tis[i][j].first.first-tis[i][j-1].first.first,tis[i][j].second));
            deg[tis[i][j].second]++;
        }
    }
    dijk();
    /*
    for (i=0;i<c;i++) {
        for (j=0;j<lis[i].size();j++) {
            printf("%d (%d,%d) -> %d (%d,%d) : %d\n",i,ord[i].first+1,ord[i].second,
                                                     lis[i][j].second,ord[lis[i][j].second].first+1,
                                                     ord[lis[i][j].second].second,lis[i][j].first);
        }
    }
    for (i=0;i<c;i++) {
        printf("%d, %d : %d\n",ord[i].first+1,ord[i].second,dis[i]);
    }
    */
    scanf("%d",&q);
    for (i=0;i<q;i++) {
        int a;
        scanf("%d",&a);
        int idx = upper_bound(tis[n-1].begin(),tis[n-1].end(),piii(pii(a,2),987654321))-tis[n-1].begin()-1;
        if (idx<0) {
            printf("-1\n");
            continue;
        }
        if (dis[tis[n-1][idx].second]>a) {
            printf("-1\n");
            continue;
        }
        printf("%d\n",tis[n-1][idx].first.first-dis[tis[n-1][idx].second]);
    }

    return 0;
}

Compilation message

bus.cpp: In function 'void dijk()':
bus.cpp:27:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i=0;i<lis[here].size();i++) {
                   ^
bus.cpp: In function 'int main()':
bus.cpp:42:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
                        ^
bus.cpp:45:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d",&a,&b,&c,&d);
                                      ^
bus.cpp:74:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
                   ^
bus.cpp:77:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a);
                       ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27816 KB Output is correct
2 Correct 6 ms 27952 KB Output is correct
3 Correct 9 ms 27816 KB Output is correct
4 Correct 6 ms 27816 KB Output is correct
5 Correct 9 ms 27816 KB Output is correct
6 Correct 3 ms 27816 KB Output is correct
7 Correct 13 ms 27816 KB Output is correct
8 Correct 6 ms 27816 KB Output is correct
9 Correct 9 ms 27816 KB Output is correct
10 Correct 3 ms 27816 KB Output is correct
11 Correct 13 ms 27948 KB Output is correct
12 Correct 6 ms 28080 KB Output is correct
13 Correct 6 ms 28080 KB Output is correct
14 Correct 6 ms 27948 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 27816 KB Output is correct
2 Correct 39 ms 27816 KB Output is correct
3 Correct 49 ms 27816 KB Output is correct
4 Correct 9 ms 27816 KB Output is correct
5 Correct 9 ms 27816 KB Output is correct
6 Correct 6 ms 27816 KB Output is correct
7 Correct 29 ms 27816 KB Output is correct
8 Correct 3 ms 27816 KB Output is correct
9 Correct 23 ms 27816 KB Output is correct
10 Correct 46 ms 28080 KB Output is correct
11 Correct 29 ms 28080 KB Output is correct
12 Correct 53 ms 27948 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 793 ms 55140 KB Output is correct
2 Correct 946 ms 55140 KB Output is correct
3 Correct 893 ms 55140 KB Output is correct
4 Correct 859 ms 55140 KB Output is correct
5 Correct 936 ms 55140 KB Output is correct
6 Correct 973 ms 55148 KB Output is correct
7 Execution timed out 1000 ms 56356 KB Execution timed out
8 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 936 ms 55140 KB Output is correct
2 Correct 913 ms 55140 KB Output is correct
3 Correct 836 ms 55140 KB Output is correct
4 Correct 846 ms 55140 KB Output is correct
5 Correct 833 ms 55140 KB Output is correct
6 Correct 983 ms 55148 KB Output is correct
7 Correct 903 ms 56356 KB Output is correct
8 Correct 946 ms 55160 KB Output is correct
9 Execution timed out 1000 ms 55156 KB Execution timed out
10 Halted 0 ms 0 KB -