oj.uz

답안 #793027

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793027 2023-07-25T12:47:39 Z JakobZorz The Potion of Great Power (CEOI20_potion) C++14
0 / 100
 501 ms 262144 KB 
#include<iostream>
#include<set>
#include<vector>
#include<unordered_set>
using namespace std;
typedef long long ll;
const int TREE_SIZE=1<<20;

vector<int>elements;

struct Node;

Node* insert_fn(Node* old_node,int x,int q);

struct Node{
    int val=0;
    Node*ch1=nullptr,*ch2=nullptr;
    
    int get_fn(int l,int r,int x){
        if(l==r-1)
            return val;
        int m=(l+r)/2;
        if(x<m){
            if(ch1)
                return ch1->get_fn(l,m,x);
        }else{
            if(ch2)
                return ch2->get_fn(m,r,x);
        }
        return 0;
    }
    
    int get(int x){
        return get_fn(0,TREE_SIZE,x);
    }
    
    void collect_fn(int l,int r){
        if(l==r-1){
            if(val)
                elements.push_back(l);
            return;
        }
        int m=(l+r)/2;
        if(ch1)
            ch1->collect_fn(l,m);
        if(ch2)
            ch2->collect_fn(m,r);
    }
    
    vector<int>collect(){
        elements.clear();
        collect_fn(0,TREE_SIZE);
        return elements;
    }
    
    ~Node(){
        delete ch1;
        delete ch2;
    }
};

Node* insert_fn(Node* old_node,int x,int q,int l,int r){
    if(x<l||r<=x)
        return old_node;
    
    Node* node=new Node;
    if(old_node){
        node->ch1=old_node->ch1;
        node->ch2=old_node->ch2;
        node->val=old_node->val;
    }
    
    if(l==r-1){
        node->val+=q;
        return node;
    }
    
    int m=(l+r)/2;
    node->ch1=insert_fn(node->ch1,x,q,l,m);
    node->ch2=insert_fn(node->ch2,x,q,m,r);
    
    return node;
}

Node* insert(Node* old_node,int x,int q){
    return insert_fn(old_node,x,q,0,TREE_SIZE);
}

// time travelling multiset
class TTMS{
    vector<int>days;
    vector<Node*>sets;
public:
    TTMS(){
        days={-1};
        sets={new Node};
    }
    
    void add_new_day(int day){
        days.push_back(day);
        sets.push_back(sets.back());
    }
    
    void insert(int el){
        sets.back()=::insert(sets.back(),el,1);
    }
    
    void remove(int el){
        sets.back()=::insert(sets.back(),el,-1);
    }
    
    vector<int> get(int day){
        int i=0;
        while(i<(int)days.size()-1&&days[i+1]<=day)
            i++;
        return sets[i]->collect();
    }
};


int get_closest(vector<int>a,vector<int>b){
    int res=1e9;
    for(int i:a)
        for(int j:b){
            res=min(res,abs(i-j));
        }
    return res;
}


int n;
int heights[100000];
TTMS ttms[100000];

void init(int N, int D, int H[]) {
    n=N;
    for(int i=0;i<n;i++)
        heights[i]=H[i];
}

ll to(int a,int b){
    if(a<b)
        swap(a,b);
    return a+((ll)b<<32);
}

void curseChanges(int U, int A[], int B[]) {
    unordered_set<ll>conns;
    for(int day=0;day<U;day++){
        int a=A[day],b=B[day];
        ll conn=to(a,b);
        ttms[a].add_new_day(day+1);
        ttms[b].add_new_day(day+1);
        if(conns.find(conn)==conns.end()){
            conns.insert(conn);
            ttms[a].insert(heights[b]);
            ttms[b].insert(heights[a]);
        }else{
            conns.erase(conn);
            ttms[a].remove(heights[b]);
            ttms[b].remove(heights[a]);
        }
    }
}

int question(int x, int y, int v) {
    vector<int>a=ttms[x].get(v);
    vector<int>b=ttms[y].get(v);
    
    return get_closest(a,b);
}

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14416 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 14416 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 175 ms 30696 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 501 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 15056 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14416 KB Output is correct
2 Incorrect 11 ms 14416 KB Incorrect
3 Halted 0 ms 0 KB -