# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641811 | manizare | Exam (eJOI20_exam) | C++14 | 246 ms | 392248 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define all(a) a.begin(),a.end()
#define pb push_back
#define int long long
using namespace std ;
const int maxn = 5002 , maxq = 1e5+10 , mod = 998244353 ,inf = 1e18 ;
int dp[3][maxn][maxn] , n , a[maxq] , b[maxq] , l[maxq] , r[maxq] , c[maxq] , p[maxq] ;
stack<int> s , t;
set <int > ff;
int solve(int n){
map <int , int > m , q ;
int cnt = 1 ;
for(int i = 1; i <= n ; i++){
m[a[i]] = cnt ;
p[cnt] = i ;
cnt++;
}
cnt = 1;
vector <int> v , last ;
last.pb(0);
for(int i = 1; i <= n ; i++){
last.pb(inf);
if(m[b[i]] == 0)continue ;
int ind = p[m[b[i]]] ;
if(l[ind] < i && r[ind] > i){
if(q[b[i]] == 0){
q[b[i]] = cnt ;
cnt++;
Compilation message (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... |