oj.uz

Submission #243869

# Submission time Handle Problem Language Result Execution time Memory
243869 2020-07-02T03:38:45 Z Leonardo_Paes Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 24 ms 31232 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
#define f first
#define s second
const int maxn = 3e4+10, magic = 250, inf = 0x3f3f3f3f;
int b[maxn], p[maxn], dist1[maxn], dist2[maxn][magic+5];
vector<int> doges[maxn];
bool mark[maxn];
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int n, m;
    cin >> n >> m;
    for(int i=0; i<m; i++){
        cin >> b[i] >> p[i];
        doges[b[i]].push_back(i);
    }
    priority_queue<pip, vector<pip>, greater<pip>> fila;
    memset(dist1, inf, sizeof dist1);
    memset(dist2, inf, sizeof dist2);
    fila.push({0, {b[0], 0}});
    mark[0] = 1;
    while(!fila.empty()){
        int d = fila.top().f, u = fila.top().s.f, id = fila.top().s.s, power = p[fila.top().s.s];
        fila.pop();
        if(power <= magic){
            if(dist2[u][power] == inf) dist2[u][power] = d;
            if(u + power < n and dist2[u + power][power] == inf){
                fila.push({d + 1, {u + power, id}});
                dist2[u + power][power] = d + 1;
            }
            if(u - power >= 0 and dist2[u - power][power] == inf){
                fila.push({d + 1, {u - power, id}});
                dist2[u - power][power] = d + 1;
            }
        }
        else{
            dist1[u] = min(dist1[u], d);
            if(mark[id]) continue;
            mark[id] = 1;
            for(int v=u+power, qtd=1; v<n; v+=power, qtd++){
                if(dist1[v] == inf) dist1[v] = min(dist1[v], d + qtd);
            }
            for(int v=u-power, qtd=1; v>=0; v-=power, qtd++){
                if(dist1[v] == inf) dist1[v] = min(dist1[v], d + qtd);
            }
        }
        if(!doges[u].empty()){
            for(auto v : doges[u]) fila.push({d, {u, v}});
            doges[u].clear();
        }
    }
    int ans = dist1[b[1]];
    for(int i=1; i<=magic; i++) ans = min(ans, dist2[b[1]][i]);
    cout << (ans == inf ? -1 : ans) << "\n";
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 31104 KB Output is correct
2 Correct 20 ms 31104 KB Output is correct
3 Correct 21 ms 31104 KB Output is correct
4 Correct 21 ms 31104 KB Output is correct
5 Correct 21 ms 31104 KB Output is correct
6 Correct 21 ms 31104 KB Output is correct
7 Correct 21 ms 31104 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 31104 KB Output is correct
2 Correct 23 ms 31104 KB Output is correct
3 Correct 21 ms 30976 KB Output is correct
4 Correct 21 ms 31104 KB Output is correct
5 Correct 20 ms 31104 KB Output is correct
6 Correct 21 ms 31104 KB Output is correct
7 Correct 20 ms 31104 KB Output is correct
8 Correct 20 ms 31104 KB Output is correct
9 Correct 21 ms 31104 KB Output is correct
10 Correct 21 ms 31104 KB Output is correct
11 Correct 22 ms 31232 KB Output is correct
12 Correct 21 ms 31232 KB Output is correct
13 Correct 23 ms 31232 KB Output is correct
14 Correct 22 ms 31232 KB Output is correct
15 Correct 21 ms 31232 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31104 KB Output is correct
2 Correct 21 ms 31104 KB Output is correct
3 Correct 21 ms 31104 KB Output is correct
4 Correct 21 ms 31104 KB Output is correct
5 Correct 20 ms 31104 KB Output is correct
6 Correct 21 ms 31104 KB Output is correct
7 Correct 20 ms 31104 KB Output is correct
8 Correct 20 ms 31104 KB Output is correct
9 Correct 20 ms 31104 KB Output is correct
10 Correct 21 ms 31104 KB Output is correct
11 Correct 22 ms 31232 KB Output is correct
12 Correct 21 ms 31232 KB Output is correct
13 Correct 22 ms 31232 KB Output is correct
14 Correct 21 ms 31232 KB Output is correct
15 Correct 22 ms 31232 KB Output is correct
16 Correct 22 ms 31104 KB Output is correct
17 Correct 23 ms 31232 KB Output is correct
18 Correct 23 ms 31224 KB Output is correct
19 Correct 21 ms 31104 KB Output is correct
20 Correct 22 ms 31216 KB Output is correct
21 Correct 22 ms 31104 KB Output is correct
22 Correct 21 ms 31232 KB Output is correct
23 Incorrect 21 ms 31104 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31104 KB Output is correct
2 Correct 21 ms 31104 KB Output is correct
3 Correct 22 ms 31104 KB Output is correct
4 Correct 21 ms 31104 KB Output is correct
5 Correct 21 ms 31104 KB Output is correct
6 Correct 22 ms 31104 KB Output is correct
7 Correct 21 ms 31104 KB Output is correct
8 Correct 21 ms 31104 KB Output is correct
9 Correct 20 ms 31104 KB Output is correct
10 Correct 21 ms 31104 KB Output is correct
11 Correct 21 ms 31232 KB Output is correct
12 Correct 21 ms 31232 KB Output is correct
13 Correct 23 ms 31232 KB Output is correct
14 Correct 22 ms 31232 KB Output is correct
15 Correct 22 ms 31232 KB Output is correct
16 Correct 21 ms 31104 KB Output is correct
17 Correct 23 ms 31232 KB Output is correct
18 Correct 22 ms 31104 KB Output is correct
19 Correct 21 ms 31104 KB Output is correct
20 Correct 22 ms 31232 KB Output is correct
21 Correct 21 ms 31104 KB Output is correct
22 Correct 21 ms 31104 KB Output is correct
23 Incorrect 21 ms 31104 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 31104 KB Output is correct
2 Correct 20 ms 31104 KB Output is correct
3 Correct 20 ms 31104 KB Output is correct
4 Correct 23 ms 31104 KB Output is correct
5 Correct 22 ms 31104 KB Output is correct
6 Correct 20 ms 31104 KB Output is correct
7 Correct 22 ms 31104 KB Output is correct
8 Correct 23 ms 31104 KB Output is correct
9 Correct 22 ms 31104 KB Output is correct
10 Correct 22 ms 31104 KB Output is correct
11 Correct 22 ms 31232 KB Output is correct
12 Correct 23 ms 31232 KB Output is correct
13 Correct 22 ms 31232 KB Output is correct
14 Correct 22 ms 31232 KB Output is correct
15 Correct 22 ms 31232 KB Output is correct
16 Correct 21 ms 31104 KB Output is correct
17 Correct 23 ms 31232 KB Output is correct
18 Correct 21 ms 31104 KB Output is correct
19 Correct 22 ms 31232 KB Output is correct
20 Correct 21 ms 31232 KB Output is correct
21 Correct 21 ms 31104 KB Output is correct
22 Correct 21 ms 31104 KB Output is correct
23 Incorrect 21 ms 31104 KB Output isn't correct
24 Halted 0 ms 0 KB -