oj.uz

Submission #540693

# Submission time Handle Problem Language Result Execution time Memory
540693 2022-03-21T12:34:45 Z FatihSolak Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 1000 ms 1436 KB 
#include <bits/stdc++.h>
#define N 30005
using namespace std;
vector<int> v[N];
bool vis[N];
map<pair<int,int>,vector<int>> mp;
vector<pair<pair<int,int>,int>> extend;
vector<pair<pair<int,int>,int>> extend2;
vector<int> nxt;
int n;
void add(pair<int,int> a,int b){
    if(mp[a].empty()){
        mp[a].resize(n / a.first + 1);
    }
    if(mp[a][b])return;
    mp[a][b] = 1;
    if(b*a.first + a.second < n && !vis[b*a.first + a.second]){
        vis[b*a.first + a.second] = 1;
        nxt.push_back(b*a.first + a.second);
    }
    if(b+1 < mp[a].size() && !mp[a][b+1])
        extend2.push_back({a,b+1});
    if(b-1 >= 0 && !mp[a][b-1])
        extend2.push_back({a,b-1});
}
void solve(){
    int m;
    cin >> n >> m;
    int st = -1;
    int nd = -1;
    for(int i=1;i<=m;i++){
        int a,b;
        cin >> a >> b;
        if(st == -1)st = a;
        else if(nd == -1)nd = a;
        v[a].push_back(b);
    }
    vector<int> nws;
    vis[st] = 1;
    nws.push_back(st);
    int cnt = 0;
    while(nws.size() || extend.size()){
        nxt.clear();
        extend2.clear();
        for(auto u:nws){
            if(u == nd){
                cout <<  cnt << endl;
                return;
            }
            for(auto c:v[u]){
                add({c,u % c},u / c);
            }
        }
        for(auto u:extend2)
            extend.push_back(u);
        extend2.clear();
        for(auto u:extend){
            add(u.first,u.second);
        }
        for(auto u:extend2)
            extend.push_back(u);
        swap(nws,nxt);  
        cnt++;
    }
    cout << -1 << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

skyscraper.cpp: In function 'void add(std::pair<int, int>, int)':
skyscraper.cpp:21:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if(b+1 < mp[a].size() && !mp[a][b+1])
      |        ~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 42 ms 1364 KB Output is correct
15 Correct 3 ms 1364 KB Output is correct
16 Execution timed out 1089 ms 980 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 39 ms 1364 KB Output is correct
15 Correct 4 ms 1364 KB Output is correct
16 Execution timed out 1092 ms 980 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 980 KB Output is correct
2 Correct 1 ms 980 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 980 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 39 ms 1436 KB Output is correct
15 Correct 3 ms 1364 KB Output is correct
16 Execution timed out 1081 ms 980 KB Time limit exceeded
17 Halted 0 ms 0 KB -