제출 #1041794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041794		12345678	Tenis (COI19_tenis)	C++17	51 / 100	1078 ms	2292 KiB

tenis

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

int n, q, p[4][nx], t, x, a, b, opr, mx[nx], res;

void solve()
{
    for (int i=1; i<=n; i++) mx[i]=0;
    for (int i=1; i<=n; i++) mx[min({p[1][i], p[2][i], p[3][i]})]++;
    res=n+1;
    for (int i=n; i>=1; i--) mx[i]+=mx[i+1];
    for (int i=n; i>1; i--) if (mx[i]==(n-i+1)) res=i;
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>q;
    for (int i=1; i<=n; i++) cin>>x, p[1][x]=i;
    for (int i=1; i<=n; i++) cin>>x, p[2][x]=i;
    for (int i=1; i<=n; i++) cin>>x, p[3][x]=i;
    solve();
    while (q--)
    {
        cin>>opr;
        if (opr==1) cin>>a, cout<<(min({p[1][a], p[2][a], p[3][a]})<res?"DA\n":"NE\n");
        else cin>>t>>a>>b, swap(p[t][a], p[t][b]), solve();
    }
}

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