oj.uz

Submission #1081013

# Submission time Handle Problem Language Result Execution time Memory
1081013 2024-08-29T16:58:34 Z anton Text editor (CEOI24_editor) C++17
16 / 100
 3280 ms 219900 KB 
#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>

int N;
vector<int> l;
vector<pii> interesting;
vector<pair<int, pii>> get_adj(pii pos){
    int line = pos.first;
    int col = pos.second;
    vector<pair<int, pii>> res;

    for(auto e: interesting){
        if(e.first == line){
            res.push_back({abs(e.second-col), e});
        }
    }
    
    res.push_back({col, {line, 0}});
    res.push_back({l[line]-1-col, {line, l[line]-1}});
    if(line<N-1){
        res.push_back({1, {line+1, min(l[line+1]-1, col)}});
        if(col == l[line]-1){
            res.push_back({1, {line+1,0}});
        }
    }
    if(line>0){
        res.push_back({1, {line-1, min(l[line-1]-1, col)}});
        if(col == 0){
            res.push_back({1, {line-1, l[line-1]-1}});
        }
    }
    return res;
}

int flat(pii a){
    return a.first* 1001 + a.second;
}

int BFS(pii begin, pii dest){
    priority_queue<pair<int, pii>> pq;
    pq.push({-0, begin});
    unordered_map<int, int> dist;
    dist[flat(begin)] = 0;

    while(pq.size()>0){
        auto cur= pq.top();
        cur.first*=-1;
        pq.pop();
        //cout<<cur.first<<" "<<cur.second.first<<" "<<cur.second.second<<endl;
        
        
        for(auto e: get_adj(cur.second)){
            int cost = e.first + cur.first;
            if(dist.find(flat(e.second)) == dist.end() || dist[flat(e.second)] >cost){

                pq.push({-cost, e.second});
                dist[flat(e.second)] = cost;
            }
        }
    
    }   

    return dist[flat(dest)];
}
signed main(){
    cin>>N;
    l.resize(N);

    pii begin;
    pii dest;
    cin>>begin.first>>begin.second;
    cin>>dest.first>>dest.second;
    begin.first--;
    begin.second--;
    dest.first--;
    dest.second--;
    
    interesting.push_back(begin);
    interesting.push_back(dest);
    for(int i = 0; i<N; i++){
        cin>>l[i];
        l[i]++;
    }

    cout<<BFS(begin, dest)<<endl;    
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
5.0 / 5.0

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

Subtask #2
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 7 ms 860 KB Output is correct
13 Correct 4 ms 948 KB Output is correct
14 Correct 5 ms 1116 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 4 ms 860 KB Output is correct
18 Correct 163 ms 19664 KB Output is correct
19 Incorrect 140 ms 19724 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 6 ms 860 KB Output is correct
19 Correct 7 ms 860 KB Output is correct
20 Correct 4 ms 948 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 163 ms 19664 KB Output is correct
26 Incorrect 140 ms 19724 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 344 KB Output is correct
19 Correct 2952 ms 210176 KB Output is correct
20 Correct 3280 ms 217928 KB Output is correct
21 Correct 2920 ms 219900 KB Output is correct
22 Correct 3070 ms 215644 KB Output is correct
23 Correct 1926 ms 201764 KB Output is correct

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 6 ms 860 KB Output is correct
19 Correct 7 ms 860 KB Output is correct
20 Correct 4 ms 948 KB Output is correct
21 Correct 5 ms 1116 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 163 ms 19664 KB Output is correct
26 Incorrect 140 ms 19724 KB Output isn't correct
27 Halted 0 ms 0 KB -