# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12165 | xhae | 전선 연결하기 (GA9_wire) | C++14 | 4 ms | 11204 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 <algorithm>
#include <stack>
#include <vector>
using namespace std;
int n, data[600000];
vector<int> loc[300000];
stack<int> upper, lower;
char ans[600001];
int main(void)
{
scanf("%d", &n);
for(int i = 0; i < n * 2; i++)
{
scanf("%d", data + i);
data[i]--;
loc[data[i]].push_back(i);
}
for(int i = 0; i < n * 2; i++)
{
if(upper.size() > 0 && upper.top() == i) { upper.pop(); ans[i] = '^'; }
else if(lower.size() > 0 && lower.top() == i) { lower.pop(); ans[i] = 'v'; }
else
{
int v = data[i];
# | 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... |