# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428570 | markthitrin | Gondola (IOI14_gondola) | C++14 | 57 ms | 5060 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 "gondola.h"
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
class name {
public:
int value;
int base;
bool operator<(const name& b) const{
return value > b.value;
}
void operator=(const name& b){
value = b.value;
base = b.base;
}
}put_in;
int mod = 1000000009;
int valid(int n, int inputSeq[])
{
std::map<int,bool> g;
int max = 0;
int find_min = 2000000000;
int min_pos = 0;
for(int q = 0 ;q<n;q++){
if(g[inputSeq[q]])
return 0;
g[inputSeq[q]] = true;
if(find_min > inputSeq[q]){
find_min = inputSeq[q];
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... |
# | 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... |