# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856197 | Benmath | popa (BOI18_popa) | C++14 | 423 ms | 676 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.
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include<popa.h>
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,pair<int,int>>;
int solver(int prvi, int drugi, int lijevo[], int desno[]){
for(int i = prvi; i <= drugi; i++){
if(lijevo[i] <= prvi and drugi <= desno[i]){
return i;
}
}
}
int solve(int N, int* Left, int* Right){
int n = N;
int lijevo[n];
int desno[n];
for(int i = 0; i < n; i++){
Left[i] = -1;
Right[i] = -1;
lijevo[i] = i;
int l = 0;
int r = i - 1;
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... |