oj.uz

Submission #333290

# Submission time Handle Problem Language Result Execution time Memory
333290 2020-12-05T09:11:21 Z blue Jakarta Skyscrapers (APIO15_skyscraper) C++11
36 / 100
 1000 ms 2688 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;

const int MAX_M = 30000;

int dist0[MAX_M];

struct doge
{
    int p;
};

bool operator < (doge X, doge Y)
{
    if(dist0[X.p] == dist0[Y.p]) return X.p < Y.p;
    return dist0[X.p] < dist0[Y.p];
}

int main()
{
    int N, M;
    cin >> N >> M;

    int B[M], P[M];
    vector<int> doge_pos[N];
    for(int i = 0; i < M; i++)
    {
        cin >> B[i] >> P[i];
        doge_pos[ B[i] ].push_back(i);
    }

    dist0[0] = 0;
    for(int i = 1; i < M; i++) dist0[i] = 2000000000;

    set<doge> dogeset;
    for(int i = 0; i < M; i++) dogeset.insert(doge{i});

    while(!dogeset.empty())
    {
        doge g = *dogeset.begin();
        dogeset.erase(g);

        int i = g.p;
        for(int v = B[i] % P[i]; v < N; v += P[i]) for(int j: doge_pos[v]) if(i != j) {
            int weight = abs((B[j] - B[i]) / P[i]);
            if (dist0[j] > dist0[i] + weight) {
                dogeset.erase(doge{j});
                dist0[j] = dist0[i] + weight;
                dogeset.insert(doge{j});
            }
        }
    }
    if(dist0[1] == 2000000000) cout << "-1\n";
    else cout << dist0[1] << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 380 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 24 ms 492 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 4 ms 492 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 24 ms 492 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 4 ms 492 KB Output is correct
15 Correct 4 ms 492 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 4 ms 492 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 35 ms 620 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 376 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 4 ms 492 KB Output is correct
25 Correct 4 ms 492 KB Output is correct
26 Correct 34 ms 492 KB Output is correct
27 Correct 33 ms 620 KB Output is correct
28 Correct 3 ms 620 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 5 ms 492 KB Output is correct
34 Correct 5 ms 492 KB Output is correct
35 Correct 91 ms 2284 KB Output is correct
36 Correct 9 ms 748 KB Output is correct
37 Correct 64 ms 1900 KB Output is correct
38 Correct 97 ms 2688 KB Output is correct
39 Correct 90 ms 2668 KB Output is correct
40 Correct 99 ms 2668 KB Output is correct
41 Correct 94 ms 2668 KB Output is correct
42 Execution timed out 1098 ms 2412 KB Time limit exceeded
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 26 ms 492 KB Output is correct
13 Correct 24 ms 492 KB Output is correct
14 Correct 4 ms 492 KB Output is correct
15 Correct 4 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 4 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 34 ms 620 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 4 ms 492 KB Output is correct
25 Correct 4 ms 492 KB Output is correct
26 Correct 34 ms 492 KB Output is correct
27 Correct 34 ms 500 KB Output is correct
28 Correct 3 ms 620 KB Output is correct
29 Correct 2 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 5 ms 492 KB Output is correct
34 Correct 5 ms 492 KB Output is correct
35 Correct 73 ms 2412 KB Output is correct
36 Correct 9 ms 748 KB Output is correct
37 Correct 62 ms 1772 KB Output is correct
38 Correct 96 ms 2540 KB Output is correct
39 Correct 89 ms 2540 KB Output is correct
40 Correct 99 ms 2540 KB Output is correct
41 Correct 96 ms 2540 KB Output is correct
42 Execution timed out 1097 ms 2412 KB Time limit exceeded
43 Halted 0 ms 0 KB -