# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849680 | adhityamv | Sequence (APIO23_sequence) | C++17 | 2054 ms | 56924 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>
using namespace std;
int sequence(int n,vector<int> A){
int x=0;
int a[n];
int b[n];
int cnt[n]={};
vector<int> ind[n];
for(int i=0;i<n;i++){
A[i]--;
cnt[A[i]]++;
if(A[i]>0) a[i]=-1;
else a[i]=1;
if(A[i]<0) b[i]=-1;
else b[i]=1;
ind[A[i]].push_back(i);
}
int ans=0;
while(x<n){
if(cnt[x]!=0){
int spa[2*n+1];
int epa[2*n+1];
for(int i=0;i<=2*n;i++){
spa[i]=-1;
epa[i]=-1;
}
int spb[2*n+1];
int epb[2*n+1];
for(int i=0;i<=2*n;i++){
spb[i]=-1;
# | 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... |