oj.uz

답안 #309790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309790 2020-10-04T14:17:00 Z AmineWeslati Building Skyscrapers (CEOI19_skyscrapers) C++14
8 / 100
 184 ms 10480 KB 
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[8] = {-1, -1, -1, 0 ,0,1,1,1}, ny[8] = {0, 1, -1, 1,-1,1,0,-1}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

void IO() {
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

//right left down up
int op(int m){
	if(m==0) return 1;
	if(m==1) return 0;
	if(m==2) return 3;
	return 2;
}

bool check(int m, int mm){
	if(m==mm || m==op(mm)) return false;
	return true;
}


int main() {
	boost; 

	int N,t; cin>>N>>t;
	vi X(N),Y(N); 
	map<pi,bool> here;
	map<pi,int> mp;

	int ii=0,xx=2e9;
	FOR(i,0,N){
		cin>>X[i]>>Y[i]; 
		here[{X[i],Y[i]}]=true; 
		mp[{X[i],Y[i]}]=i;
		if(X[i]<xx){
			xx=X[i];
			ii=i;
		}
	}


	queue<int> q; q.push(ii);
	bool vis[N]; FOR(i,0,N) vis[i]=false;
	vis[ii]=true;

	vi res;
	while(!q.empty()){
		int idx=q.front();
		q.pop();
		res.pb(idx+1);
		int x=X[idx],y=Y[idx];

		FOR(m,0,8){
			int nwx=x+nx[m],nwy=y+ny[m];

			if(here.count({nwx,nwy})==true && !vis[mp[{nwx,nwy}]]){
				int ni=mp[{nwx,nwy}];
				vis[ni]=true;
				q.push(ni);
			}

			//Doesn't work?
			/*FOR(mm,0,4)if(check(m,mm)){
				nwx=nwx+nx[mm],nwy=nwy+ny[mm];
				if(here.count({nwx,nwy})==true && !vis[mp[{nwx,nwy}]]){
					int ni=mp[{nwx,nwy}];
					vis[ni]=true;
					q.push(ni);
				}
			}*/
		}
	}

	if(sz(res)<N) cout << "NO" << endl;
	else{
		cout << "YES" << endl;
		for(auto x: res) cout << x << endl;

	}


	return 0;
}

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

skyscrapers.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
skyscrapers.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
skyscrapers.cpp: In function 'void IO()':
skyscrapers.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscrapers.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ans=YES N=1
2 Correct 0 ms 384 KB ans=YES N=4
3 Correct 0 ms 384 KB ans=NO N=4
4 Correct 1 ms 384 KB ans=YES N=5
5 Correct 0 ms 384 KB ans=YES N=9
6 Correct 0 ms 384 KB ans=YES N=5
7 Correct 1 ms 384 KB ans=NO N=9
8 Correct 0 ms 384 KB ans=NO N=10
9 Correct 0 ms 384 KB ans=YES N=10
10 Correct 0 ms 384 KB ans=YES N=10
11 Correct 0 ms 384 KB ans=YES N=10
12 Correct 1 ms 384 KB ans=YES N=9
13 Correct 0 ms 384 KB ans=YES N=9
14 Correct 0 ms 384 KB ans=YES N=8
15 Correct 1 ms 384 KB ans=YES N=8
16 Correct 0 ms 384 KB ans=NO N=2

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ans=YES N=1
2 Correct 0 ms 384 KB ans=YES N=4
3 Correct 0 ms 384 KB ans=NO N=4
4 Correct 1 ms 384 KB ans=YES N=5
5 Correct 0 ms 384 KB ans=YES N=9
6 Correct 0 ms 384 KB ans=YES N=5
7 Correct 1 ms 384 KB ans=NO N=9
8 Correct 0 ms 384 KB ans=NO N=10
9 Correct 0 ms 384 KB ans=YES N=10
10 Correct 0 ms 384 KB ans=YES N=10
11 Correct 0 ms 384 KB ans=YES N=10
12 Correct 1 ms 384 KB ans=YES N=9
13 Correct 0 ms 384 KB ans=YES N=9
14 Correct 0 ms 384 KB ans=YES N=8
15 Correct 1 ms 384 KB ans=YES N=8
16 Correct 0 ms 384 KB ans=NO N=2
17 Correct 0 ms 384 KB ans=YES N=17
18 Correct 1 ms 384 KB ans=YES N=25
19 Correct 1 ms 384 KB ans=YES N=100
20 Correct 1 ms 384 KB ans=YES N=185
21 Correct 1 ms 384 KB ans=NO N=174
22 Correct 0 ms 384 KB ans=YES N=90
23 Correct 1 ms 384 KB ans=YES N=63
24 Correct 1 ms 384 KB ans=YES N=87
25 Correct 1 ms 384 KB ans=YES N=183
26 Correct 1 ms 384 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 1 ms 384 KB ans=YES N=189
29 Correct 1 ms 384 KB ans=YES N=200
30 Correct 1 ms 384 KB ans=YES N=190
31 Correct 1 ms 384 KB ans=YES N=187
32 Correct 1 ms 384 KB ans=YES N=187
33 Correct 1 ms 384 KB ans=YES N=182
34 Correct 1 ms 384 KB ans=YES N=184
35 Correct 1 ms 384 KB ans=YES N=188
36 Correct 1 ms 384 KB ans=YES N=181
37 Correct 1 ms 384 KB ans=YES N=188
38 Correct 1 ms 384 KB ans=YES N=191
39 Incorrect 1 ms 384 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ans=YES N=1
2 Correct 0 ms 384 KB ans=YES N=4
3 Correct 0 ms 384 KB ans=NO N=4
4 Correct 1 ms 384 KB ans=YES N=5
5 Correct 0 ms 384 KB ans=YES N=9
6 Correct 0 ms 384 KB ans=YES N=5
7 Correct 1 ms 384 KB ans=NO N=9
8 Correct 0 ms 384 KB ans=NO N=10
9 Correct 0 ms 384 KB ans=YES N=10
10 Correct 0 ms 384 KB ans=YES N=10
11 Correct 0 ms 384 KB ans=YES N=10
12 Correct 1 ms 384 KB ans=YES N=9
13 Correct 0 ms 384 KB ans=YES N=9
14 Correct 0 ms 384 KB ans=YES N=8
15 Correct 1 ms 384 KB ans=YES N=8
16 Correct 0 ms 384 KB ans=NO N=2
17 Correct 0 ms 384 KB ans=YES N=17
18 Correct 1 ms 384 KB ans=YES N=25
19 Correct 1 ms 384 KB ans=YES N=100
20 Correct 1 ms 384 KB ans=YES N=185
21 Correct 1 ms 384 KB ans=NO N=174
22 Correct 0 ms 384 KB ans=YES N=90
23 Correct 1 ms 384 KB ans=YES N=63
24 Correct 1 ms 384 KB ans=YES N=87
25 Correct 1 ms 384 KB ans=YES N=183
26 Correct 1 ms 384 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 1 ms 384 KB ans=YES N=189
29 Correct 1 ms 384 KB ans=YES N=200
30 Correct 1 ms 384 KB ans=YES N=190
31 Correct 1 ms 384 KB ans=YES N=187
32 Correct 1 ms 384 KB ans=YES N=187
33 Correct 1 ms 384 KB ans=YES N=182
34 Correct 1 ms 384 KB ans=YES N=184
35 Correct 1 ms 384 KB ans=YES N=188
36 Correct 1 ms 384 KB ans=YES N=181
37 Correct 1 ms 384 KB ans=YES N=188
38 Correct 1 ms 384 KB ans=YES N=191
39 Incorrect 1 ms 384 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB ans=NO N=1934
2 Correct 2 ms 640 KB ans=NO N=1965
3 Incorrect 5 ms 640 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB ans=YES N=1
2 Correct 0 ms 384 KB ans=YES N=4
3 Correct 0 ms 384 KB ans=NO N=4
4 Correct 1 ms 384 KB ans=YES N=5
5 Correct 0 ms 384 KB ans=YES N=9
6 Correct 0 ms 384 KB ans=YES N=5
7 Correct 1 ms 384 KB ans=NO N=9
8 Correct 0 ms 384 KB ans=NO N=10
9 Correct 0 ms 384 KB ans=YES N=10
10 Correct 0 ms 384 KB ans=YES N=10
11 Correct 0 ms 384 KB ans=YES N=10
12 Correct 1 ms 384 KB ans=YES N=9
13 Correct 0 ms 384 KB ans=YES N=9
14 Correct 0 ms 384 KB ans=YES N=8
15 Correct 1 ms 384 KB ans=YES N=8
16 Correct 0 ms 384 KB ans=NO N=2
17 Correct 0 ms 384 KB ans=YES N=17
18 Correct 1 ms 384 KB ans=YES N=25
19 Correct 1 ms 384 KB ans=YES N=100
20 Correct 1 ms 384 KB ans=YES N=185
21 Correct 1 ms 384 KB ans=NO N=174
22 Correct 0 ms 384 KB ans=YES N=90
23 Correct 1 ms 384 KB ans=YES N=63
24 Correct 1 ms 384 KB ans=YES N=87
25 Correct 1 ms 384 KB ans=YES N=183
26 Correct 1 ms 384 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 1 ms 384 KB ans=YES N=189
29 Correct 1 ms 384 KB ans=YES N=200
30 Correct 1 ms 384 KB ans=YES N=190
31 Correct 1 ms 384 KB ans=YES N=187
32 Correct 1 ms 384 KB ans=YES N=187
33 Correct 1 ms 384 KB ans=YES N=182
34 Correct 1 ms 384 KB ans=YES N=184
35 Correct 1 ms 384 KB ans=YES N=188
36 Correct 1 ms 384 KB ans=YES N=181
37 Correct 1 ms 384 KB ans=YES N=188
38 Correct 1 ms 384 KB ans=YES N=191
39 Incorrect 1 ms 384 KB Added cell 196 (16,2) not reachable from infinity
40 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 9844 KB ans=NO N=66151
2 Correct 73 ms 8952 KB ans=NO N=64333
3 Incorrect 182 ms 10480 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 33786)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 640 KB ans=NO N=1934
2 Correct 2 ms 640 KB ans=NO N=1965
3 Incorrect 5 ms 640 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -