oj.uz

Submission #564514

# Submission time Handle Problem Language Result Execution time Memory
564514 2022-05-19T10:19:08 Z Uzouf Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 120 ms 23824 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define endl "\n"
int mod=1e9+7;
const int N=2e5+5;
template<class x>
using ordered_multiset = tree<x, null_type,less_equal<x>, rb_tree_tag,tree_order_statistics_node_update>;
 
int n,t;
map<pair<int,int>,bool> mp;
map<pair<int,int>,int> plc;
vector<pair<int,int> > v;
vector<pair<int,int> > vv;
 
bool chk() {
  bool bl=true;
  sort(v.begin(),v.end());
 
  for (int i=1;i<n;i++) {
    if ((v[i].first-v[i-1].first)>1) {bl=false; break;}
  }
 
  sort(vv.begin(),vv.end());
  for (int i=1;i<n;i++) {
    if ((vv[i].first-vv[i-1].first)>1) {bl=false; break;}
  }
  return bl;
}
 
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen(".in", "r", stdin); freopen(".out", "w", stdout);
 
    cin>>n>>t;
    for (int i=0;i<n;i++) {
      int x,y; cin>>x>>y;
      mp[{x,y}]=true;
      plc[{x,y}]=i+1;
      v.push_back({x,y});
      vv.push_back({y,x});
    }

    sort(v.begin(),v.end());
 
    vector<int> ans;
 
    for (int i=0;i<n;i++) {
      ans.push_back(plc[v[i]]);
    }
 
    bool bl=true;
    for (int i=1;i<n;i++) {
      int x=v[i].first,y=v[i].second;
      if (mp[{x-1,y}] || mp[{x,y-1}] || mp[{x-1,y-1}] || mp[{x-1,y+1}]) continue;
      bl=false;
    }
    if (!bl) {cout<<"NO"; return 0;}
 
    cout<<"YES"<<endl;
    for (int i:ans) {cout<<i<<endl;}
}

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 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 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 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 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 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB ans=NO N=1934
2 Correct 3 ms 724 KB ans=NO N=1965
3 Incorrect 2 ms 600 KB Contestant did not find solution
4 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 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 13096 KB ans=NO N=66151
2 Correct 120 ms 23824 KB ans=NO N=64333
3 Incorrect 84 ms 12736 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB ans=NO N=1934
2 Correct 3 ms 724 KB ans=NO N=1965
3 Incorrect 2 ms 600 KB Contestant did not find solution
4 Halted 0 ms 0 KB -