oj.uz

Submission #254076

# Submission time Handle Problem Language Result Execution time Memory
254076 2020-07-29T10:36:12 Z amiratou Tenis (COI19_tenis) C++14
18 / 100
 500 ms 53228 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,idx,comp[100005],in[100005],s[100005];
bool ans[100005];
pair<ii,ii> queries[100005];
multiset<int> adj[100005];
unordered_set<int> res[100005],vec[100005];
v parts[100005];
bitset<100005> vis;
v order;
void gimme(int node){
    vis[node]=1;
    for(auto it:adj[node])
        if(!vis[it])gimme(it);
}
void top(int node){
    vis[node]=1;
    for(auto it:adj[node])
        if(!vis[it])top(it);
    order.pb(node);
}
void dfs(int node){
    vis[node]=1;
    s[idx]++,parts[idx].pb(node);
    comp[node]=idx;
    for(auto it:res[node])
        if(!vis[it])dfs(it);
}
void compute(int node){
    for(auto it:vec[node])
        compute(it),s[node]+=s[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]),res[tab[i][j]].insert(tab[i][j-1]);
        }
    }
    bool st=0;
    for (int i = 0; i < q; ++i)
    {
        cin>>queries[i].fi.fi>>queries[i].fi.se;
        if(queries[i].fi.fi==2)cin>>queries[i].se.fi>>queries[i].se.se,st=1;
    }
    if(!st){
        for (int i = 1; i <= n; ++i)
            if(!vis[i])top(i);
        reverse(all(order));
        vis=0;
        for(auto it:order)
            if(!vis[it])dfs(it),idx++;
        for (int i = 1; i <= n; ++i)
            for(auto it:adj[i])
                if(comp[i]!=comp[it])
                    vec[comp[i]].insert(comp[it]),in[comp[it]]++;
        for (int i = 0; i < idx; ++i)
            if(!in[i]){
                compute(i);
                if(s[i]==n)for(auto it:parts[i])ans[it]=1;
            }
        for (int e = 0; e < q; ++e){
            if(ans[queries[e].fi.se])cout<<"DA\n";
            else cout<<"NE\n";
        }
        return 0;
    }
    for (int e = 0; e < q; ++e){
        t=queries[e].fi.fi;
        if(t==1){
            x=queries[e].fi.se;
            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{
            x=queries[e].fi.se,a=queries[e].se.fi,b=queries[e].se.se;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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 18432 KB Output is correct
2 Correct 11 ms 18304 KB Output is correct
3 Correct 11 ms 18304 KB Output is correct
4 Correct 11 ms 18304 KB Output is correct
5 Correct 12 ms 18304 KB Output is correct
6 Correct 11 ms 18304 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 18432 KB Output is correct
2 Correct 11 ms 18304 KB Output is correct
3 Correct 11 ms 18304 KB Output is correct
4 Correct 11 ms 18304 KB Output is correct
5 Correct 12 ms 18304 KB Output is correct
6 Correct 11 ms 18304 KB Output is correct
7 Correct 13 ms 18688 KB Output is correct
8 Correct 13 ms 18688 KB Output is correct
9 Correct 16 ms 18688 KB Output is correct
10 Correct 15 ms 18688 KB Output is correct
11 Correct 16 ms 18688 KB Output is correct
12 Correct 13 ms 18688 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 18432 KB Output is correct
2 Correct 11 ms 18304 KB Output is correct
3 Correct 11 ms 18304 KB Output is correct
4 Correct 11 ms 18304 KB Output is correct
5 Correct 12 ms 18304 KB Output is correct
6 Correct 11 ms 18304 KB Output is correct
7 Correct 13 ms 18688 KB Output is correct
8 Correct 13 ms 18688 KB Output is correct
9 Correct 16 ms 18688 KB Output is correct
10 Correct 15 ms 18688 KB Output is correct
11 Correct 16 ms 18688 KB Output is correct
12 Correct 13 ms 18688 KB Output is correct
13 Correct 492 ms 50040 KB Output is correct
14 Correct 407 ms 50936 KB Output is correct
15 Correct 403 ms 49916 KB Output is correct
16 Correct 435 ms 50040 KB Output is correct
17 Correct 470 ms 49128 KB Output is correct
18 Correct 422 ms 49472 KB Output is correct
19 Execution timed out 546 ms 49144 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 18432 KB Output is correct
2 Correct 11 ms 18304 KB Output is correct
3 Correct 11 ms 18304 KB Output is correct
4 Correct 11 ms 18304 KB Output is correct
5 Correct 12 ms 18304 KB Output is correct
6 Correct 11 ms 18304 KB Output is correct
7 Correct 13 ms 18688 KB Output is correct
8 Correct 13 ms 18688 KB Output is correct
9 Correct 16 ms 18688 KB Output is correct
10 Correct 15 ms 18688 KB Output is correct
11 Correct 16 ms 18688 KB Output is correct
12 Correct 13 ms 18688 KB Output is correct
13 Correct 492 ms 50040 KB Output is correct
14 Correct 407 ms 50936 KB Output is correct
15 Correct 403 ms 49916 KB Output is correct
16 Correct 435 ms 50040 KB Output is correct
17 Correct 470 ms 49128 KB Output is correct
18 Correct 422 ms 49472 KB Output is correct
19 Execution timed out 546 ms 49144 KB Time limit exceeded
20 Halted 0 ms 0 KB -