# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
254068 |
2020-07-29T10:06:27 Z |
amiratou |
Tenis (COI19_tenis) |
C++14 |
|
500 ms |
24696 KB |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ld long double
#define ll long long
//#define int ll
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 1000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
int tab[3][100005],pos[100005][3],n;
multiset<int> adj[100005];
bitset<100005> vis;
void gimme(int node){
vis[node]=1;
for(auto it:adj[node])
if(!vis[it])gimme(it);
}
int32_t main(){
//boost;
//freopen(".in","r",stdin);
int q,x,t,a,b;
cin>>n>>q;
for (int i = 0; i < 3; ++i){
for (int j = 0; j < n; ++j){
cin>>tab[i][j],pos[tab[i][j]][i]=j;
if(j)adj[tab[i][j-1]].insert(tab[i][j]);
}
}
while(q--){
cin>>t;
if(t==1){
cin>>x;
for (int i = 1; i <= n; ++i)
vis[i]=0;
gimme(x);
bool f=1;
for (int i = 1; i <= n; ++i)
if(!vis[i]){f=0;break;}
if(f)cout<<"DA\n";
else cout<<"NE\n";
}
else{
cin>>x>>a>>b,x--;
if(pos[a][x]>pos[b][x])
swap(a,b);
if((pos[a][x]+1)==pos[b][x]){
adj[a].erase(adj[a].find(b));
if(pos[a][x]){
adj[tab[x][pos[a][x]-1]].erase(adj[tab[x][pos[a][x]-1]].find(a));
adj[tab[x][pos[a][x]-1]].insert(b);
}
if(pos[b][x]!=(n-1)){
adj[b].erase(adj[b].find(tab[x][pos[b][x]+1]));
adj[a].insert(tab[x][pos[b][x]+1]);
}
adj[b].insert(a);
}
else{
if(pos[a][x]){
adj[tab[x][pos[a][x]-1]].erase(adj[tab[x][pos[a][x]-1]].find(a));
adj[tab[x][pos[a][x]-1]].insert(b);
}
if(pos[a][x]!=(n-1)){
adj[a].erase(adj[a].find(tab[x][pos[a][x]+1]));
adj[b].insert(tab[x][pos[a][x]+1]);
}
if(pos[b][x]){
adj[tab[x][pos[b][x]-1]].erase(adj[tab[x][pos[b][x]-1]].find(b));
adj[tab[x][pos[b][x]-1]].insert(a);
}
if(pos[b][x]!=(n-1)){
adj[b].erase(adj[b].find(tab[x][pos[b][x]+1]));
adj[a].insert(tab[x][pos[b][x]+1]);
}
}
swap(tab[x][pos[a][x]],tab[x][pos[b][x]]);
swap(pos[a][x],pos[b][x]);
}
}
return 0;
}
//do smth instead of nothing and stay organized
//long long
//array bounds
//special cases
//binary search
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4992 KB |
Output is correct |
2 |
Correct |
3 ms |
4992 KB |
Output is correct |
3 |
Correct |
3 ms |
5120 KB |
Output is correct |
4 |
Correct |
4 ms |
4992 KB |
Output is correct |
5 |
Correct |
3 ms |
4992 KB |
Output is correct |
6 |
Correct |
3 ms |
4992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4992 KB |
Output is correct |
2 |
Correct |
3 ms |
4992 KB |
Output is correct |
3 |
Correct |
3 ms |
5120 KB |
Output is correct |
4 |
Correct |
4 ms |
4992 KB |
Output is correct |
5 |
Correct |
3 ms |
4992 KB |
Output is correct |
6 |
Correct |
3 ms |
4992 KB |
Output is correct |
7 |
Correct |
4 ms |
5248 KB |
Output is correct |
8 |
Correct |
4 ms |
5248 KB |
Output is correct |
9 |
Correct |
5 ms |
5248 KB |
Output is correct |
10 |
Correct |
5 ms |
5248 KB |
Output is correct |
11 |
Correct |
5 ms |
5248 KB |
Output is correct |
12 |
Correct |
4 ms |
5248 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4992 KB |
Output is correct |
2 |
Correct |
3 ms |
4992 KB |
Output is correct |
3 |
Correct |
3 ms |
5120 KB |
Output is correct |
4 |
Correct |
4 ms |
4992 KB |
Output is correct |
5 |
Correct |
3 ms |
4992 KB |
Output is correct |
6 |
Correct |
3 ms |
4992 KB |
Output is correct |
7 |
Correct |
4 ms |
5248 KB |
Output is correct |
8 |
Correct |
4 ms |
5248 KB |
Output is correct |
9 |
Correct |
5 ms |
5248 KB |
Output is correct |
10 |
Correct |
5 ms |
5248 KB |
Output is correct |
11 |
Correct |
5 ms |
5248 KB |
Output is correct |
12 |
Correct |
4 ms |
5248 KB |
Output is correct |
13 |
Correct |
252 ms |
23800 KB |
Output is correct |
14 |
Correct |
255 ms |
24088 KB |
Output is correct |
15 |
Correct |
262 ms |
24312 KB |
Output is correct |
16 |
Correct |
274 ms |
23928 KB |
Output is correct |
17 |
Correct |
345 ms |
24696 KB |
Output is correct |
18 |
Correct |
272 ms |
24696 KB |
Output is correct |
19 |
Correct |
287 ms |
24440 KB |
Output is correct |
20 |
Correct |
227 ms |
23160 KB |
Output is correct |
21 |
Correct |
308 ms |
24568 KB |
Output is correct |
22 |
Correct |
293 ms |
24312 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1095 ms |
22520 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
4992 KB |
Output is correct |
2 |
Correct |
3 ms |
4992 KB |
Output is correct |
3 |
Correct |
3 ms |
5120 KB |
Output is correct |
4 |
Correct |
4 ms |
4992 KB |
Output is correct |
5 |
Correct |
3 ms |
4992 KB |
Output is correct |
6 |
Correct |
3 ms |
4992 KB |
Output is correct |
7 |
Correct |
4 ms |
5248 KB |
Output is correct |
8 |
Correct |
4 ms |
5248 KB |
Output is correct |
9 |
Correct |
5 ms |
5248 KB |
Output is correct |
10 |
Correct |
5 ms |
5248 KB |
Output is correct |
11 |
Correct |
5 ms |
5248 KB |
Output is correct |
12 |
Correct |
4 ms |
5248 KB |
Output is correct |
13 |
Correct |
252 ms |
23800 KB |
Output is correct |
14 |
Correct |
255 ms |
24088 KB |
Output is correct |
15 |
Correct |
262 ms |
24312 KB |
Output is correct |
16 |
Correct |
274 ms |
23928 KB |
Output is correct |
17 |
Correct |
345 ms |
24696 KB |
Output is correct |
18 |
Correct |
272 ms |
24696 KB |
Output is correct |
19 |
Correct |
287 ms |
24440 KB |
Output is correct |
20 |
Correct |
227 ms |
23160 KB |
Output is correct |
21 |
Correct |
308 ms |
24568 KB |
Output is correct |
22 |
Correct |
293 ms |
24312 KB |
Output is correct |
23 |
Execution timed out |
1095 ms |
22520 KB |
Time limit exceeded |
24 |
Halted |
0 ms |
0 KB |
- |