oj.uz

Submission #382049

# Submission time Handle Problem Language Result Execution time Memory
382049 2021-03-26T10:23:15 Z kshitij_sodani Tenis (COI19_tenis) C++14
18 / 100
 500 ms 4732 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
int n,q;
int it[100001][3];
int vis[100001][3];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>q;
	for(int i=0;i<n;i++){
		cin>>it[i][0];
	}
	for(int i=0;i<n;i++){
		cin>>it[i][1];
	}
	for(int i=0;i<n;i++){
		cin>>it[i][2];
	}
	while(q--){
		int tt;
		cin>>tt;
		if(tt==1){
			int x;
			cin>>x;
			int st=0;
			for(int i=1;i<=n;i++){
				for(int j=0;j<3;j++){
					vis[i][j]=0;
				}
			}
			for(int i=0;i<n;i++){
				int kk=1;
				for(int j=0;j<3;j++){
					vis[it[i][j]][j]=1;
				}
				if(vis[x][0]+vis[x][1]+vis[x][2]>0){
					kk=0;
					break;
				}
				for(int j=1;j<=n;j++){
					if(vis[j][0]!=vis[j][1] or vis[j][0]!=vis[j][2]){
						kk=0;
						break;
					}
				}
				if(kk==1){
					st=1;
					break;
				}
			}
			if(st==0){
				cout<<"DA"<<endl;
			}
			else{
				cout<<"NE"<<endl;
			}

		}
		else{
			int x,y,z;
			cin>>x>>y>>z;
			x--;
			int ind=-1;
			int ind2=-1;
			for(int i=0;i<n;i++){
				if(it[i][x]==y){
					ind=i;
				}
				if(it[i][x]==z){
					ind2=i;
				}
			}
			//cout<<ind<<":"<<ind2<<endl;
			swap(it[ind][x],it[ind2][x]);
		}
	}






 
	return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Execution timed out 1091 ms 4460 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 4732 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Execution timed out 1091 ms 4460 KB Time limit exceeded
14 Halted 0 ms 0 KB -