oj.uz

Submission #1085734

# Submission time Handle Problem Language Result Execution time Memory
1085734 2024-09-08T15:50:45 Z codexistent Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 3420 KB 
#include <iostream>
#include <vector>
#include <set>
using namespace std;
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define MAXN 30005
 
int n, m, t[MAXN], s, e;
vector<int> p[MAXN];
set<int> a;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    FOR(i, 0, n - 1) t[i] = -1;
    FOR(i, 0, m - 1){
        int b, pi; cin >> b >> pi;
        if(i == 0) s = b, t[b] = 0;
        if(i == 1) e = b;
        p[b].push_back(pi);
    }
    FOR(i, 0, n - 1) if(i != s) a.insert(i);
    
    int c = s;
    pair<int, int> nx = make_pair(-1, -1);
    while(c != -1){
        for(int i : a){
            for(int j : p[c]){
                if(abs(i - c) % j == 0){
                    t[i] = (t[i] == -1) ? (t[c] + (int)abs(i - c) / j) : min(t[i], t[c] + (int)abs(i - c) / j);
                }
            }
            
          if(t[i] != -1 && (nx.first == -1 || (nx.first > t[i]))){
            nx.first = t[i];
            nx.second = i;
          }
        }
        
        c = nx.second;
        a.erase(nx.second);
        nx.first = nx.second = -1;
    }
    
    cout << t[e] << "\n";
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1176 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1168 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 12 ms 1352 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 9 ms 1176 KB Output is correct
24 Correct 13 ms 1112 KB Output is correct
25 Correct 13 ms 1112 KB Output is correct
26 Correct 11 ms 1116 KB Output is correct
27 Correct 12 ms 1296 KB Output is correct
28 Correct 12 ms 1116 KB Output is correct
29 Correct 14 ms 1284 KB Output is correct
30 Correct 11 ms 1112 KB Output is correct
31 Correct 12 ms 1276 KB Output is correct
32 Correct 12 ms 1272 KB Output is correct
33 Correct 19 ms 1116 KB Output is correct
34 Correct 19 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1172 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1204 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 4 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 12 ms 1216 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 12 ms 1324 KB Output is correct
25 Correct 13 ms 1116 KB Output is correct
26 Correct 11 ms 1300 KB Output is correct
27 Correct 11 ms 1176 KB Output is correct
28 Correct 12 ms 1116 KB Output is correct
29 Correct 14 ms 1280 KB Output is correct
30 Correct 10 ms 1268 KB Output is correct
31 Correct 12 ms 1276 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct
33 Correct 19 ms 1368 KB Output is correct
34 Correct 19 ms 1112 KB Output is correct
35 Correct 42 ms 1624 KB Output is correct
36 Correct 8 ms 1116 KB Output is correct
37 Correct 44 ms 1372 KB Output is correct
38 Correct 67 ms 1628 KB Output is correct
39 Correct 67 ms 1720 KB Output is correct
40 Correct 67 ms 1628 KB Output is correct
41 Correct 67 ms 1624 KB Output is correct
42 Correct 18 ms 1628 KB Output is correct
43 Correct 25 ms 1628 KB Output is correct
44 Correct 16 ms 1592 KB Output is correct
45 Correct 131 ms 1628 KB Output is correct
46 Correct 130 ms 1628 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1184 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1112 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 12 ms 1348 KB Output is correct
21 Correct 1 ms 1112 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 10 ms 1280 KB Output is correct
24 Correct 12 ms 1112 KB Output is correct
25 Correct 13 ms 1116 KB Output is correct
26 Correct 15 ms 1116 KB Output is correct
27 Correct 11 ms 1116 KB Output is correct
28 Correct 12 ms 1260 KB Output is correct
29 Correct 14 ms 1116 KB Output is correct
30 Correct 11 ms 1116 KB Output is correct
31 Correct 13 ms 1116 KB Output is correct
32 Correct 11 ms 1116 KB Output is correct
33 Correct 19 ms 1116 KB Output is correct
34 Correct 19 ms 1300 KB Output is correct
35 Correct 42 ms 1564 KB Output is correct
36 Correct 8 ms 1112 KB Output is correct
37 Correct 46 ms 1444 KB Output is correct
38 Correct 67 ms 1628 KB Output is correct
39 Correct 67 ms 1624 KB Output is correct
40 Correct 67 ms 1628 KB Output is correct
41 Correct 68 ms 1624 KB Output is correct
42 Correct 18 ms 1628 KB Output is correct
43 Correct 25 ms 1628 KB Output is correct
44 Correct 16 ms 1628 KB Output is correct
45 Correct 132 ms 1628 KB Output is correct
46 Correct 133 ms 1628 KB Output is correct
47 Correct 731 ms 2136 KB Output is correct
48 Correct 7 ms 2904 KB Output is correct
49 Correct 7 ms 2908 KB Output is correct
50 Correct 7 ms 2976 KB Output is correct
51 Execution timed out 1048 ms 3420 KB Time limit exceeded
52 Halted 0 ms 0 KB -