# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12212 | qja0950 | 전선 연결하기 (GA9_wire) | C++98 | 0 ms | 8196 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.
//
// main.cpp
// 4. ?????? ?????????? (wire)
//
// Created by KJBS2 on 2014. 12. 24..
// Copyright (c) 2014년 KJBS2. All rights reserved.
//
#include <stdio.h>
#define MAX_N 303303
int N;
int Where[MAX_N][2];
int Light[MAX_N];
void INPUT() {
scanf("%d", &N);
for(int i=1; i<=N*2; i++) {
scanf("%d", &Light[i]);
if(Where[Light[i]][0] == 0)
Where[Light[i]][0] = i;
else
Where[Light[i]][1] = i;
}
return;
}
int U[MAX_N], Up;
int D[MAX_N], Dp;
# | 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... |