Submission #1193394

#TimeUsernameProblemLanguageResultExecution timeMemory
1193394yuichiro179월 (APIO24_september)C++20
100 / 100
71 ms7424 KiB
#include "september.h" #include <bits/stdc++.h> using namespace std; int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) { vector<vector<int>> rs(M,vector<int>(N)); for(int i=0;i<M;i++){ rs[i][0]=N; } for(int i=0;i<N-1;i++){ for(int j=0;j<M;j++){ rs[j][S[j][i]]=i; } } int ans=0; int mi = N-2; for(int i=N-2;i>=0;i--){ if(mi>i){ mi=i; } for(int j=0;j<M;j++){ mi = min(mi,rs[j][S[0][i]]); mi = min(mi,rs[j][F[S[0][i]]]); } if(i==mi){ ans++; } } return ans; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...