| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1359603 | nlsosad | BOI Acronym (BOI25_boi) | C++20 | 194 ms | 14224 KiB |
#include <bits/stdc++.h>
using namespace std;
int a[2005][2005];
int main(){
int n;
cin >> n;
for (int i = 1;i<=n;++i){
for (int j = i;j<=n;++j){
cin >> a[i][j];
}
}
int dau = -1, cuoi = -1;
for (int i = 1;i<=n;++i){
if(a[i][n] > a[i+1][n]){
dau = i;
break;
}
}
for (int i = n;i>=1;--i){
if(a[1][i] > a[1][i-1]){
cuoi = i;
break;
}
}
cout << dau << ' ';
for (int i = dau + 1; i < cuoi; ++i) {
if (a[dau][i-1] > a[dau+1][i-1]) {
if (a[dau][i] > a[dau][i-1]) cout << i << ' ';
}
else if (a[i+1][cuoi] > a[i+1][cuoi-1]) {
if (a[i][cuoi] > a[i+1][cuoi]) cout << i << ' ';
}
else {
if (a[dau+1][i] > a[dau+1][i-1]) continue;
if (a[i][cuoi-1] > a[i+1][cuoi-1]) continue;
cout << i << ' ';
}
}
cout << cuoi;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
