oj.uz

답안 #564716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564716 2022-05-19T13:56:32 Z MrDeboo Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 143 ms 15308 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
vector<int>g;
map<pair<int,int>,int>mp;
map<pair<int,int>,bool>vis;
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,t;
    cin>>n>>t;
    pair<int,int>pr[n];
    for(int i=0;i<n;i++){
        cin>>pr[i].first>>pr[i].second;
        mp[pr[i]]=i+1;
    }
    sort(pr,pr+n);
    deque<pair<int,int>>dq={pr[0]};
    vis[pr[0]]=1;
    int x[]={1,1,1,0,0};
    int y[]={-1,0,1,-1,1};
    while(dq.size()){
        pair<int,int>p=dq.front();
        dq.pop_front();
        g.push_back(mp[p]);
        for(int i=0;i<5;i++){
            pair<int,int>pp={p.first+x[i],p.second+y[i]};
            if(!vis[pp]&&mp[pp]){
                vis[pp]=1;
                dq.push_back(pp);
            }
        }
    }
    for(int i=n-1;i>=0;i--){
        if(vis[pr[i]])continue;
        dq.push_back(pr[i]);
        vis[pr[i]]=1;
        while(dq.size()){
            pair<int,int>p=dq.front();
            dq.pop_front();
            g.push_back(mp[p]);
            for(int w=0;w<5;w++){
                pair<int,int>pp={p.first+x[w],p.second+y[w]};
                if(!vis[pp]&&mp[pp]){
                    vis[pp]=1;
                    dq.push_back(pp);
                }
            }
        }
    }
    if(g.size()!=n){cout<<"NO";}
    else{
        cout<<"YES\n";
        for(auto &i:g)cout<<i<<endl;
    }
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:55:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   55 |     if(g.size()!=n){cout<<"NO";}
      |        ~~~~~~~~^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 1 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 1 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 1 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1748 KB Full cells must be connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 1 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 143 ms 15308 KB Full cells must be connected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1748 KB Full cells must be connected
2 Halted 0 ms 0 KB -