# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158955 | georgerapeanu | Meetings (JOI19_meetings) | C++14 | 3018 ms | 3880 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 "meetings.h"
#pragma once
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
map<pair<int,int>,int> asked;
int lvl[2005];
int my_query(int u,int v,int w){
u--;
v--;
w--;
if(v == w){
return v + 1;
}
if(v > w){
swap(v,w);
}
// printf("%d %d %d\n",u,v,w);
if(asked.count({v,w}) == 0){
asked[{v,w}] = Query(u,v,w);
}
if(lvl[asked[{v,w}] + 1] < lvl[u + 1]){
return u + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |