oj.uz

Submission #25569

# Submission time Handle Problem Language Result Execution time Memory
25569 2017-06-23T05:41:30 Z 시제연(#1075) 버스 (JOI14_bus) C++
35 / 100
 1000 ms 83032 KB 
#include <bits/stdc++.h>

using namespace std;

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

struct edge {
    int a, b, c, d;
    edge(){}
    edge(int a, int b, int c, int d):a(a),b(b),c(c),d(d){}
};

edge edg[300100];
int n, m, c, q;
pii node[600100]; // node number, time
vector<pii> lis[600100];
vector<int> tis[100100];
map<pii,int> se;
pii ord[600100];
int dis[600100];
int INF = 987654321;

void dijk() {
    int i;
    map<pii,int>::iterator it = se.begin();
    priority_queue<pii> pq;
    for (i=0;i<c;i++) dis[i] = INF;
    while(it!=se.end()&&((*it).first.first==0)) {
        dis[se[(*it).first]] = 0;
        pq.push(pii(0,se[(*it).first]));
        it++;
    }
    while(!pq.empty()) {
        pii tmp = pq.top();
        pq.pop();
        int here = tmp.second;
        int d = -tmp.first;
        if (dis[here]!=d) continue;
        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;
                pq.push(pii(-dis[there],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--;
        edg[i] = edge(a,b,c,d);
        tis[a].push_back(c);
        tis[b].push_back(d);
        se.insert(piii(pii(a,c),0));
        se.insert(piii(pii(b,d),0));
    }
    for (i=0;i<n;i++) {
        sort(tis[i].begin(),tis[i].end());
        tis[i].erase(unique(tis[i].begin(),tis[i].end()),tis[i].end());
    }
    map<pii,int>::iterator it = se.begin();
    while(it!=se.end()) {
        se[(*it).first] = c;
        ord[c] = (*it).first;
        it++; c++;
    }
    for (i=0;i<m;i++) {
        int a = edg[i].a, b = edg[i].b, c = edg[i].c, d = edg[i].d;
        lis[se[pii(a,c)]].push_back(pii(d-c,se[pii(b,d)]));
    }
    for (i=0;i<n;i++) {
        for (j=(int)tis[i].size()-1;j>0;j--) {
            lis[se[pii(i,tis[i][j-1])]].push_back(pii(tis[i][j]-tis[i][j-1],se[pii(i,tis[i][j])]));
        }
    }
    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(),a)-tis[n-1].begin()-1;
        if (idx<0) {
            printf("-1\n");
            continue;
        }
        if (dis[se[pii(n-1,tis[n-1][idx])]]>a) {
            printf("-1\n");
            continue;
        }
        printf("%d\n",tis[n-1][idx]-dis[se[pii(n-1,tis[n-1][idx])]]);
    }

    return 0;
}

Compilation message

bus.cpp: In function 'void dijk()':
bus.cpp:40: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:56: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:59: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:99:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
                   ^
bus.cpp:102: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 13 ms 34984 KB Output is correct
2 Correct 6 ms 34984 KB Output is correct
3 Correct 6 ms 34984 KB Output is correct
4 Correct 9 ms 34984 KB Output is correct
5 Correct 6 ms 34984 KB Output is correct
6 Correct 6 ms 34984 KB Output is correct
7 Correct 0 ms 34984 KB Output is correct
8 Correct 3 ms 34984 KB Output is correct
9 Correct 9 ms 34984 KB Output is correct
10 Correct 6 ms 34984 KB Output is correct
11 Correct 9 ms 35248 KB Output is correct
12 Correct 13 ms 35248 KB Output is correct
13 Correct 19 ms 35248 KB Output is correct
14 Correct 3 ms 35248 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 34984 KB Output is correct
2 Correct 39 ms 34984 KB Output is correct
3 Correct 39 ms 34984 KB Output is correct
4 Correct 6 ms 34984 KB Output is correct
5 Correct 9 ms 34984 KB Output is correct
6 Correct 6 ms 34984 KB Output is correct
7 Correct 33 ms 34984 KB Output is correct
8 Correct 6 ms 34984 KB Output is correct
9 Correct 26 ms 34984 KB Output is correct
10 Correct 63 ms 35248 KB Output is correct
11 Correct 36 ms 35248 KB Output is correct
12 Correct 89 ms 35248 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 82900 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 83032 KB Execution timed out
2 Halted 0 ms 0 KB -