# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18426 | tlwpdus | 전선 연결하기 (GA9_wire) | C++98 | 4 ms | 3308 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<stdio.h>
#include<algorithm>
#include<set>
#include<vector>
#include<string.h>
#define MAXN 5010
using namespace std;
vector<int> lis[MAXN];
struct segtree {
set<int> tree[8*MAXN];
int key;
void init(int n) {
key = 1;
while(key<n) key*=2;
}
void update(int idx, int val, int type) {
idx+=key;
while(idx>0) {
if (type==1) tree[idx].insert(val);
else tree[idx].erase(val);
idx/=2;
}
}
void put(int idx, int v) {
set<int>::iterator it = tree[idx].begin();
for (;it!=tree[idx].end();it++) {
# | 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... |