oj.uz

Submission #1004360

# Submission time Handle Problem Language Result Execution time Memory
1004360 2024-06-21T08:17:30 Z codexistent Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 1 ms 1368 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(){
    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; else if(b != s) a.insert(b);
        if(i == 1) e = b;
        p[b].push_back(pi);
    }
    
    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] + abs(i - c) / j) : min(t[i], t[c] + abs(i - c) / j);
                }
            }
            
            if(nx.first == -1 || (nx.first > t[i])){
                nx.first = t[i];
                nx.second = i;
            }
        }
        
        a.erase(c);
        c = nx.second;
        nx.first = nx.second = -1;
    }
    
    cout << t[e] << endl;
}

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 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 940 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct

Subtask #2
0 / 12.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 0 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 1112 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Incorrect 1 ms 1116 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1112 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 0 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 Incorrect 1 ms 1368 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
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 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 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Incorrect 1 ms 1116 KB Output isn't correct
10 Halted 0 ms 0 KB -

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 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
8 Correct 0 ms 1148 KB Output is correct
9 Incorrect 1 ms 1112 KB Output isn't correct
10 Halted 0 ms 0 KB -