Submission #1363436

#	Time	Username	Problem	Language	Result	Execution time	Memory
1363436		mar	BOI Acronym (BOI25_boi)	C++20	63 / 100	55 ms	16128 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int nmax=2005;

int n;
int m[nmax][nmax];
vector<int> ans;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin>>n;

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            m[i][j]=0;
        }
        for(int j=i;j<n;j++){
            cin>>m[i][j];
        }
    }

    int f=-1;
    for(int i=0;i<n-1;i++){
        if(m[i][n-1]>m[i+1][n-1]){
            f=i;
            break;
        }
    }

    int l=n;
    for(int i=n-1;i>=1;i--){
        if(m[0][i]>m[0][i-1]){
            l=i;
            break;
        }
    }

    ans.push_back(f);

    for(int i=f+1;i<l;i++){

        if(m[f][i-1]>m[f+1][i-1]){
            if(m[f][i]>m[f][i-1]){
                ans.push_back(i);
                continue;
            }
        }

        if(m[i+1][l]>m[i+1][l-1]){
            if(m[i][l]>m[i+1][l]){
                ans.push_back(i);
                continue;
            }
        }

        if(m[f][i-1]==m[f+1][i-1]&&m[i+1][l]==m[i+1][l-1]){
            if(m[f+1][i]>m[f+1][i-1]){
                continue;
            }
            if(m[i][l-1]>m[i+1][l-1]){
                continue;
            }
            ans.push_back(i);
        }
    }

    ans.push_back(l);

    for(int i:ans){
        cout<<i+1<<" ";
    }

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 19 / 19
• Subtask 7: 0 / 37