# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12773 | Qwaz | 전선 연결하기 (GA9_wire) | C++14 | 0 ms | 7068 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 <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
typedef pair < int, int > pii;
const int MAX = 300020;
int n, data[MAX*2];
void input(){
scanf("%d", &n);
for(int i = 0; i < 2*n; i++)
scanf("%d", &data[i]);
}
pii upStack[MAX];
int top, status[MAX];
priority_queue < pii > down;
void solve(){
for(int i = 0; i < 2*n; i++){
int now = data[i];
if(status[now] == 0){
status[now] = 1;
upStack[top++] = pii(i, now);
} else if(status[now] == 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... |