Submission #1041655

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041655		vjudge1	Tenis (COI19_tenis)	C++17	30 / 100	1096 ms	17236 KiB

tenis

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
void solve(){
    ll n , q ,x , y , z;
    cin >> n >> q;
    int a[3][n + 1];
    map<ll,vector<ll>> mp;
    for(int i = 0; i< 3 ;i ++){
        for(int  j = 0; j < n ;j ++){
            cin >> a[i][j];
            mp[a[i][j]].push_back(j);
        }
    }
    while(q--){
        cin >> x;
        if(x == 1){
            cin >> y;
            bool flg = 1;
            ll mx1 = 0 , mx2 = 0;
            for(int i  = 0; i < n ;i ++){
                if(a[0][i] == y){
                    break;
                }
                mx1 = max(mx1 , mp[a[0][i]][1]);
                mx2 = max(mx2 , mp[a[0][i]][2]);
                if(mx1 <= i and mx2 <= i){
                    flg = 0;
                    break;
                }
            }
            if(flg){
                cout << "DA" << '\n';
            }
            else{
                cout << "NE" << '\n';
            }
        }
        else{
            cin >> x >> y >> z;
            x--;
            swap(a[x][mp[y][x]], a[x][mp[z][x]]);
            swap(mp[y][x], mp[z][x]);
        }
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tests = 1;
    // cin >> tests;
    for (int i = 1; i <= tests; i++){
        solve();
    }
    return 0;
}

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 49