oj.uz

Submission #564651

# Submission time Handle Problem Language Result Execution time Memory
564651 2022-05-19T12:36:07 Z MrDeboo Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 85 ms 7888 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>;
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(auto &i:pr)cin>>i.first>>i.second;
    pair<int,int>por[n];
    for(int i=0;i<n;i++)por[i]=pr[i];
    sort(pr,pr+n);
    vector<bool>vis(n);
    deque<pair<int,int>>dq;
    deque<pair<int,int>>g;
    int x[]={1,1,0};
    int y[]={0,1,1};
    for(int j=0;j<n;j++){
        if(vis[j])continue;
        vis[j]=1;
        dq.push_back(pr[j]);
        while(dq.size()){
            pair<int,int>p=dq.front();
            dq.pop_front();
            g.push_back(p);
            for(int i=0;i<3;i++){
                pair<int,int>pp=make_pair(p.first+x[i],p.second+y[i]);
                int k=lower_bound(pr,pr+n,pp)-pr;
                if(k!=n&&pr[k]==pp&&!vis[k]){
                    vis[k]=1;
                    dq.push_back(pp);
                }
            }
        }
    }
    if(g.size()!=n){cout<<"NO";}
    else{
        cout<<"YES\n";
        map<pair<int,int>,int>mp;
        for(int i=0;i<n;i++){
            mp[g[i]]=i+1;
        }
        for(int i=0;i<n;i++)cout<<mp[por[i]]<<endl;
    }
}

Compilation message

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

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 0 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 0 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 0 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Full cells must be connected
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Incorrect 0 ms 212 KB Full cells must be connected
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 85 ms 7888 KB Full cells must be connected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 468 KB Full cells must be connected
2 Halted 0 ms 0 KB -