oj.uz

답안 #540704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540704 2022-03-21T12:46:11 Z FatihSolak Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 298 ms 32436 KB 
#include <bits/stdc++.h>
#define N 30005
using namespace std;
vector<int> v[N];
int group[N];
int groupx[N],groupy[N];
bool vis[N];
vector<int> mp[N];
vector<pair<int,int>> extend;
vector<pair<int,int>> extend2;
vector<int> nxt;
int n;
void add(int a,int b){
    if(mp[a].empty()){
        mp[a].resize(n / groupx[a] + 1);
    }
    if(mp[a][b])return;
    mp[a][b] = 1;
    if(b*groupx[a] + groupy[a] < n && !vis[b*groupx[a] + groupy[a]]){
        vis[b*groupx[a] + groupy[a]] = 1;
        nxt.push_back(b*groupx[a] + groupy[a]);
    }
    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});
}
int x[N],y[N];
void solve(){
    int m;
    cin >> n >> m;
    int st = -1;
    int nd = -1;
    vector<pair<pair<int,int>,int>> compress;
    for(int i=1;i<=m;i++){
        int x[i],y[i];
        cin >> x[i] >> y[i];
        if(st == -1)st = x[i];
        else if(nd == -1)nd = x[i];
        v[x[i]].push_back(i);
        compress.push_back({{y[i],x[i]%y[i]},i});
    }
    sort(compress.begin(),compress.end());
    for(int i=0,cnt=0;i<compress.size();i++){
        if(i && compress[i].first != compress[i-1].first)
            cnt++;
        group[compress[i].second] = cnt;
        groupx[cnt] = compress[i].first.first;
        groupy[cnt] = compress[i].first.second;
    }
    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(group[c],u / groupx[group[c]]);
            }
        }
        for(auto u:extend2)
            extend.push_back(u);
        extend2.clear();
        for(auto u:extend){
            add(u.first,u.second);
        }
        extend.clear();
        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(int, int)':
skyscraper.cpp:23:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     if(b+1 < mp[a].size() && !mp[a][b+1])
      |        ~~~~^~~~~~~~~~~~~~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i=0,cnt=0;i<compress.size();i++){
      |                       ~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1688 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1620 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 3 ms 1876 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1880 KB Output is correct
25 Correct 2 ms 1884 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 3 ms 2012 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 2 ms 1748 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1876 KB Output is correct
33 Correct 5 ms 2388 KB Output is correct
34 Correct 4 ms 2344 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1620 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1748 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 1740 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 2 ms 1884 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 2 ms 1752 KB Output is correct
28 Correct 3 ms 2004 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 2 ms 1736 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1876 KB Output is correct
33 Correct 5 ms 2396 KB Output is correct
34 Correct 3 ms 2388 KB Output is correct
35 Correct 16 ms 4036 KB Output is correct
36 Correct 3 ms 2004 KB Output is correct
37 Correct 10 ms 3476 KB Output is correct
38 Correct 19 ms 4432 KB Output is correct
39 Correct 16 ms 3088 KB Output is correct
40 Correct 15 ms 3224 KB Output is correct
41 Correct 18 ms 3468 KB Output is correct
42 Correct 15 ms 2888 KB Output is correct
43 Correct 14 ms 2868 KB Output is correct
44 Correct 12 ms 2832 KB Output is correct
45 Correct 35 ms 6076 KB Output is correct
46 Correct 28 ms 6016 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1704 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 2 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 1 ms 1740 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 2 ms 1748 KB Output is correct
17 Correct 2 ms 1880 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 1748 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1876 KB Output is correct
24 Correct 2 ms 1884 KB Output is correct
25 Correct 2 ms 1876 KB Output is correct
26 Correct 2 ms 1748 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 3 ms 1940 KB Output is correct
29 Correct 3 ms 2004 KB Output is correct
30 Correct 1 ms 1748 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1872 KB Output is correct
33 Correct 5 ms 2316 KB Output is correct
34 Correct 3 ms 2260 KB Output is correct
35 Correct 18 ms 4112 KB Output is correct
36 Correct 4 ms 2016 KB Output is correct
37 Correct 10 ms 3464 KB Output is correct
38 Correct 20 ms 4400 KB Output is correct
39 Correct 17 ms 3080 KB Output is correct
40 Correct 16 ms 3224 KB Output is correct
41 Correct 18 ms 3472 KB Output is correct
42 Correct 14 ms 2832 KB Output is correct
43 Correct 14 ms 2840 KB Output is correct
44 Correct 13 ms 2816 KB Output is correct
45 Correct 33 ms 6084 KB Output is correct
46 Correct 26 ms 6100 KB Output is correct
47 Correct 18 ms 4480 KB Output is correct
48 Correct 12 ms 3088 KB Output is correct
49 Correct 11 ms 3104 KB Output is correct
50 Correct 7 ms 2652 KB Output is correct
51 Correct 24 ms 4900 KB Output is correct
52 Correct 23 ms 5088 KB Output is correct
53 Correct 18 ms 3728 KB Output is correct
54 Correct 2 ms 1748 KB Output is correct
55 Correct 2 ms 1876 KB Output is correct
56 Correct 16 ms 3728 KB Output is correct
57 Correct 2 ms 2144 KB Output is correct
58 Correct 16 ms 2952 KB Output is correct
59 Correct 16 ms 2948 KB Output is correct
60 Correct 17 ms 3044 KB Output is correct
61 Correct 15 ms 3088 KB Output is correct
62 Correct 36 ms 6380 KB Output is correct
63 Correct 83 ms 12784 KB Output is correct
64 Correct 102 ms 14836 KB Output is correct
65 Correct 147 ms 19784 KB Output is correct
66 Correct 298 ms 32436 KB Output is correct
67 Correct 174 ms 32316 KB Output is correct