#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
os << "[";
for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
os << "]\n";
return os;
}
#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
os << "" << p.first << " " << p.second << "";
return os;
}
void usaco(string taskname) {
string fin = taskname + ".in";
string fout = taskname + ".out";
const char *FIN = fin.c_str();
const char *FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T> &v) {
int n = v.size();
for (int i = 0; i < n; i++)
cin >> v[i];
}
template<typename T>
vector<T> UNQ(vector<T> a) {
vector<T> ans;
for (T t:a)
if (ans.empty() || t != ans.back())
ans.push_back(t);
return ans;
}
ll ceil(ll a, ll b) {
ll ans = a / b;
if (a % b)ans++;
return ans;
}
ld log(ld a, ld b) { return log(b) / log(a); }
ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
ll ans = 1;
while (exp) {
if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
base = ((base % M) * (base % M)) % M;
exp /= 2;
}
return ans;
}
string to_base(int n, int new_base) {
string s;
int nn = n;
while (nn) {
s += to_string(nn % new_base);
nn /= new_base;
}
reverse(all(s));
return s;
}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll x = (a / gcd(a, b));
return b * x;
}
vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
if (mx == 1e18 + 1)
mx = n;
vl ans(n);
for (int i = 0; i < n; i++)
ans[i] = (mn + rand() % (mx - mn + 1));
return ans;
}
string substr(string s, int l, int r) {
string ans;
for (int i = l; i <= r; i++)
ans += s[i];
return ans;
}
void solve();
int main() {
GLHF;
int t = 1;
//cin >> t;
while (t--)
solve();
}
umap<int,umap<int,bool>>vis,has;
umap<int,umap<int,int>>ix;
void dfs1(int i,int j){
if(!has[i][j] || vis[i][j])
return;
vis[i][j]=1;
for(int dx:{-1,0,1})
for(int dy:{-1,0,1})
if(dx || dy)
dfs1(i+dx,j+dy);
}
queue<pl> out;
void dfs2(int i,int j){
if(!has[i][j] || vis[i][j])
return;
vis[i][j]=1;
int cnt=0;
for(int dx:{-1,0,1})
for(int dy:{-1,0,1})
if((dx==0)^(dy==0) && !has[i+dx][j+dy])
cnt++;
if(cnt==2)
out.push({i,j});
for(int dx:{-1,0,1})
for(int dy:{-1,0,1})
if(dx || dy)
dfs2(i+dx,j+dy);
}
vl ans;
void solve() {
int n,t;
cin >> n >> t;
vpl a(n);
read(a);
for(int i=0; i<n; i++)
has[a[i].first][a[i].second]=1,ix[a[i].first][a[i].second]=i+1;
dfs1(a[0].first,a[0].second);
for(int i=0; i<n ;i++)
if(!vis[a[i].first][a[i].second])NO
cout << "YES\n";
vis.clear();
dfs2(a[0].first,a[0].second);
vis.clear();
pl lst;
while(out.size()){
pl src=out.front();
out.pop();
ll i=src.first,j=src.second;
if(vis[i][j])
continue;
vis[i][j]=1;
lst={i,j};
for(int dx:{-1,0,1})
for(int dy:{-1,0,1})
if((dx || dy) && has[i+dx][j+dy] && !vis[i+dx][j+dy])
out.push({i+dx,j+dy});
}
vis.clear();
out.push(lst);
while(out.size()){
pl src=out.front();
out.pop();
ll i=src.first,j=src.second;
if(vis[i][j])
continue;
ans.pb(ix[i][j]);
vis[i][j]=1;
for(int dx:{-1,0,1})
for(int dy:{-1,0,1})
if((dx || dy) && has[i+dx][j+dy] && !vis[i+dx][j+dy])
out.push({i+dx,j+dy});
}
print(ans)
}
Compilation message
skyscrapers.cpp: In function 'void usaco(std::string)':
skyscrapers.cpp:56:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
56 | freopen(FIN, "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~
skyscrapers.cpp:57:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
57 | freopen(FOUT, "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Integer 0 violates the range [1, 1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Integer 0 violates the range [1, 1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Integer 0 violates the range [1, 1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1228 KB |
ans=NO N=1934 |
| 2 |
Correct |
2 ms |
460 KB |
ans=NO N=1965 |
| 3 |
Incorrect |
6 ms |
844 KB |
Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1049) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
204 KB |
Integer 0 violates the range [1, 1] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
114 ms |
15036 KB |
ans=NO N=66151 |
| 2 |
Correct |
43 ms |
7212 KB |
ans=NO N=64333 |
| 3 |
Incorrect |
390 ms |
21464 KB |
Contestant's solution is not lexicographically largest at index 69316 (69235 vs 6892) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1228 KB |
ans=NO N=1934 |
| 2 |
Correct |
2 ms |
460 KB |
ans=NO N=1965 |
| 3 |
Incorrect |
6 ms |
844 KB |
Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1049) |
| 4 |
Halted |
0 ms |
0 KB |
- |
