oj.uz

Submission #1085739

# Submission time Handle Problem Language Result Execution time Memory
1085739 2024-09-08T15:52:51 Z codexistent Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 2208 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;
bool ac[MAXN];
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) ac[i] = true;
    
    int c = s;
    pair<int, int> nx = make_pair(-1, -1);
    while(c != -1){
        FOR(i, 0, n - 1) if(ac[i]) {
            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;
        ac[c] = false;
        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 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 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 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 1 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 1 ms 1148 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 1 ms 996 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 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 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 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
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 10 ms 1368 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 5 ms 1228 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct
25 Correct 9 ms 1240 KB Output is correct
26 Correct 5 ms 1116 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 8 ms 1112 KB Output is correct
29 Correct 8 ms 1116 KB Output is correct
30 Correct 7 ms 1184 KB Output is correct
31 Correct 6 ms 1116 KB Output is correct
32 Correct 6 ms 1116 KB Output is correct
33 Correct 14 ms 1184 KB Output is correct
34 Correct 15 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 0 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 1 ms 1116 KB Output is correct
9 Correct 0 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 1112 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 8 ms 1260 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1112 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 9 ms 1128 KB Output is correct
25 Correct 8 ms 1116 KB Output is correct
26 Correct 5 ms 1116 KB Output is correct
27 Correct 4 ms 1116 KB Output is correct
28 Correct 8 ms 1116 KB Output is correct
29 Correct 8 ms 1200 KB Output is correct
30 Correct 5 ms 1112 KB Output is correct
31 Correct 9 ms 1116 KB Output is correct
32 Correct 10 ms 1112 KB Output is correct
33 Correct 14 ms 1368 KB Output is correct
34 Correct 14 ms 1116 KB Output is correct
35 Correct 41 ms 1624 KB Output is correct
36 Correct 7 ms 1112 KB Output is correct
37 Correct 42 ms 1412 KB Output is correct
38 Correct 66 ms 1628 KB Output is correct
39 Correct 64 ms 1628 KB Output is correct
40 Correct 65 ms 1624 KB Output is correct
41 Correct 67 ms 1628 KB Output is correct
42 Correct 15 ms 1628 KB Output is correct
43 Correct 19 ms 1628 KB Output is correct
44 Correct 10 ms 1632 KB Output is correct
45 Correct 123 ms 1584 KB Output is correct
46 Correct 123 ms 1368 KB Output is correct

Subtask #5
0 / 43.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 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 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 1 ms 1112 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 1116 KB Output is correct
13 Correct 1 ms 1176 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 8 ms 1264 KB Output is correct
21 Correct 1 ms 1116 KB Output is correct
22 Correct 1 ms 1184 KB Output is correct
23 Correct 5 ms 1220 KB Output is correct
24 Correct 9 ms 1116 KB Output is correct
25 Correct 9 ms 1116 KB Output is correct
26 Correct 5 ms 1220 KB Output is correct
27 Correct 5 ms 1116 KB Output is correct
28 Correct 8 ms 1116 KB Output is correct
29 Correct 8 ms 1116 KB Output is correct
30 Correct 5 ms 1172 KB Output is correct
31 Correct 6 ms 1116 KB Output is correct
32 Correct 6 ms 1192 KB Output is correct
33 Correct 13 ms 1112 KB Output is correct
34 Correct 13 ms 1208 KB Output is correct
35 Correct 41 ms 1372 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 42 ms 1368 KB Output is correct
38 Correct 67 ms 1628 KB Output is correct
39 Correct 65 ms 1628 KB Output is correct
40 Correct 65 ms 1628 KB Output is correct
41 Correct 65 ms 1656 KB Output is correct
42 Correct 11 ms 1624 KB Output is correct
43 Correct 20 ms 1588 KB Output is correct
44 Correct 10 ms 1628 KB Output is correct
45 Correct 125 ms 1580 KB Output is correct
46 Correct 123 ms 1372 KB Output is correct
47 Correct 599 ms 1792 KB Output is correct
48 Correct 5 ms 1880 KB Output is correct
49 Correct 4 ms 1884 KB Output is correct
50 Correct 4 ms 1628 KB Output is correct
51 Execution timed out 1098 ms 2208 KB Time limit exceeded
52 Halted 0 ms 0 KB -