# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1158046 | SmuggingSpun | Cat Exercise (JOI23_ho_t4) | C++20 | 0 ms | 332 KiB |
#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
const int lim = 2e5 + 5;
int n, P[lim], A[lim], B[lim];
namespace sub123{
void solve(){
vector<vector<int>>f(n + 1, vector<int>(n + 1, -1)), p(n + 1, vector<int>(n + 1));
for(int i = 1; i <= n; i++){
p[i][i] = i;
for(int j = i + 1; j <= n; j++){
p[i][j] = (P[j] > P[p[i][j - 1]] ? j : p[i][j - 1]);
}
}
function<int(int, int)>dp;
dp = [&] (int l, int r){
if(l > r){
return 0;
}
int& ans = f[l][r];
if(ans != -1){
return ans;
}
int i = p[l][r];
return ans = max(dp(l, i - 1), dp(i + 1, r)) + 1;
};
cout << dp(1, n);
}
}
namespace sub4567{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n;
for(int i = 1; i <= n; i++){
cin >> P[i];
}
bool is_sub123 = true;
for(int i = 1; i < n; i++){
cin >> A[i] >> B[i];
if(A[i] != i && B[i] != i + 1){
is_sub123 = false;
}
}
if(n <= 5000 && is_sub123){
sub123::solve();
}
else{
sub4567::solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |