Submission #1347972

#TimeUsernameProblemLanguageResultExecution timeMemory
1347972edga1BOI Acronym (BOI25_boi)C++20
12 / 100
184 ms14092 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=1; l<=n; l++){
        for(int r=l; r<=n; r++){
            cin>>ma[l][r];
        }
    }
    vector<int> sk(n+1,0);
    int m=ma[1][n],p=n;
    while(ma[1][p]==m) p--;
    p++;
    sk[p]=1;
    for(int i=p+1; i<=n; i++){
        if(ma[i-1][i]==2) sk[i]=sk[i-1];
        else sk[i]=1-sk[i-1];
    }
    for(int i=p-1; i>0; i--){
        if(ma[i][i+1]==2) sk[i]=sk[i+1];
        else sk[i]=1-sk[i+1];
    }
    for(int i=1; i<=n; i++){
        if(sk[i]==1) cout<<i<<' ';
    }
    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...