oj.uz

Submission #340173

# Submission time Handle Problem Language Result Execution time Memory
340173 2020-12-27T07:52:26 Z beksultan04 Crazy old lady (IZhO13_crazy) C++14
100 / 100
 32 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool chmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool chmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 2e5+5;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
 
void solve(int test_case){
	int i, j;
	cin >> n;
	for(i=1;i<=n;i++){
		cin >> a[i];
	}
	vector<int> ans;
	for(int place_of_lady = 1; place_of_lady <= n; place_of_lady++){
		vector<int> num(n+1);
		int cnt=1;
		for(i=2;i<=n;i++){
			if(cnt == place_of_lady)cnt++;
			num[i] = cnt;cnt++;
		}
		vector<bool> used(n+1, 0);
		used[a[1]] = true;
		bool bolot = true;
		for(i=2;i<=n;i++){
			if(!used[num[i]] && a[i] != num[i]){
				bolot = false;
				break;
			}else if(!used[a[i]]){
				used[a[i]] = true;
			}
		}
		if(bolot)ans.pb(place_of_lady);
	}
	assert(ans.size() > 0);
	if(ans.size() > 1){
		cout << 0 << '\n';
	}else {
		cout << ans[0] << '\n';
	}
	return;
}
 
signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Compilation message

crazy.cpp: In function 'void solve(long long int)':
crazy.cpp:19:9: warning: unused variable 'j' [-Wunused-variable]
   19 |  int i, j;
      |         ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 3 ms 364 KB Output is correct
9 Correct 4 ms 364 KB Output is correct
10 Correct 4 ms 364 KB Output is correct
11 Correct 6 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 8 ms 364 KB Output is correct
14 Correct 13 ms 364 KB Output is correct
15 Correct 13 ms 364 KB Output is correct
16 Correct 17 ms 384 KB Output is correct
17 Correct 18 ms 364 KB Output is correct
18 Correct 27 ms 364 KB Output is correct
19 Correct 23 ms 364 KB Output is correct
20 Correct 32 ms 364 KB Output is correct