제출 #1347965

#제출 시각아이디문제언어결과실행 시간메모리
1347965edga1BOI Acronym (BOI25_boi)C++20
11 / 100
1095 ms580 KiB
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ll long long
using namespace std;

const int N=2005;
int ma[N][N];

int main()
{
    int n; cin>>n;
    for(int l=0; l<n; l++){
        for(int r=l; r<n; r++){
            cin>>ma[l][r];
        }
    }
    vector<int> sk(n,0);
    while(true){
        int e=1;
        for(int l=0; l<n; l++){
            int sk0=0,sk1=0,sk2=0;
            for(int r=l; r<n; r++){
                if(sk[r]==0) sk0++;
                if(sk[r]==1) sk1++;
                if(sk[r]==2) sk2++;
                if(max({sk0,sk1,sk2})!=ma[l][r]) e=0;
            }
            if(l==0){
                if(sk0<=sk1 || sk0<=sk2) e=0;
            }
        }
        if(e){
            for(int i=0; i<n; i++){
                if(sk[i]==0) cout<<i+1<<' ';
            }
            return 0;
        }
        sk[n-1]++;
        int p=n-1;
        while(sk[p]>2){
            sk[p]=0;
            sk[p-1]++;
            p--;
        }
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...