oj.uz

Submission #202880

# Submission time Handle Problem Language Result Execution time Memory
202880 2020-02-18T15:03:15 Z Mercenary Collapse (JOI18_collapse) C++14
0 / 100
 15000 ms 25700 KB 
#ifndef LOCAL
#include "collapse.h"
#endif // LOCAL
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair

using namespace std;
const int maxn = 1e5 + 5;
typedef pair<int,int> ii;

int n , m , q;
vector<int> Q[maxn];
int type[maxn] , x[maxn] , y[maxn];
int p[maxn] , w[maxn];
int in[maxn] , out[maxn];
int res[maxn];

struct Dsurollback{
    vector<pair<int*,int>> data;
    int lab[maxn];
    int FindLab(int u){
        return lab[u] < 0 ? u : FindLab(lab[u]);
    }
    void Change(int & u , int v){
        data.pb(mp(&u,u));
        u = v;
    }
    void rollback(int sz){
        while(data.size() > sz){
            (*data.back().first) = data.back().second;
            data.pop_back();
        }
    }
    int cnt = 0;
    void Merge(int u , int v){
        u = FindLab(u);v = FindLab(v);
        if(u == v)return;
        if(lab[u] > lab[v])swap(u,v);
        Change(lab[u],lab[u]+lab[v]);
        Change(lab[v],u);
        Change(cnt,cnt+1);
    }
    int cur(){return data.size();};
    void reset(){
        fill_n(lab,maxn,-1);cnt = 0;
        data.clear();
    }
}Dsu;

void solve(){
    const int MAGIC = 400;
    vector<int> sp  , norm;
    for(int l = 0 ; l < m ; l += MAGIC){
        int r = min(m,l+MAGIC) - 1;
        vector<int> q;
        for(int i = 0 ; i <= r ; ++i){
            if(i >= l)for(auto & id : Q[i])q.pb(id);
            if(out[i] < l || type[i] == 1)continue;
            if(i >= l || out[i] <= r)sp.pb(i);//in[i] >= l || (in[i] < l && out[i] >= l && out[i] <= r)
            else norm.pb(i);
        }
        sort(norm.begin(),norm.end(),[&](const int a , const int b){return y[a] < y[b];});
        sort(q.begin(),q.end(),[&](const int a , const int b){return p[a] < p[b];});
        int qi = 0 , qe = 0;
        Dsu.reset();
        for(int i = 0 ; i < n ; ++i){
            while(qe < norm.size() && y[norm[qe]] == i)Dsu.Merge(x[norm[qe]] , y[norm[qe]]),++qe;
            while(qi < q.size() && p[q[qi]] == i){
                int id = q[qi];
                int pre = Dsu.cur();
                for(auto & c : sp){
                    if(y[c] <= i && c <= w[id] && w[id] < out[c])Dsu.Merge(x[c],y[c]);
                }
//                cout << id << " " << Dsu.cnt<< endl;
                res[id] -= Dsu.cnt;
                Dsu.rollback(pre);
                ++qi;
            }
        }
        sort(norm.begin(),norm.end(),[&](const int a , const int b){return x[a] > x[b];});
        sort(q.begin(),q.end(),[&](const int a , const int b){return p[a] > p[b];});
        qi = 0 , qe = 0;
        Dsu.reset();
        for(int i = n - 1 ; i >= 0 ; --i){
            while(qe < norm.size() && x[norm[qe]] == i){
                Dsu.Merge(x[norm[qe]] , y[norm[qe]]),++qe;
            }
            while(qi < q.size() && p[q[qi]] == i - 1){
                int id = q[qi];
                int pre = Dsu.cur();
                for(auto & c : sp){
                    if(x[c] >= i && c <= w[id] && w[id] < out[c]){
                        Dsu.Merge(x[c],y[c]);
                    }
                }
//                cout << id << " " << Dsu.cnt<< endl;
                res[id] -= Dsu.cnt;
                Dsu.rollback(pre);
                ++qi;
            }
        }
        Dsu.reset();
    }
}

vector<int> simulateCollapse(int N,vector<int> T,vector<int> X,vector<int> Y,vector<int> W,vector<int> P)
{
    n = N;m = T.size();q = W.size();
    for(int i = 0 ; i < m ; ++i){
        type[i] = T[i];
        x[i] = X[i];y[i] = Y[i];
        if(x[i] > y[i])swap(x[i],y[i]);
    }
    for(int i = 0 ; i < q ; ++i){
        p[i] =  P[i];w[i] = W[i];
        Q[w[i]].pb(i);
    }
    map<ii,int> mmap;
    for(int i = 0 ; i < m ; ++i){
        if(type[i] == 0){
            mmap[mp(x[i],y[i])] = i;
        }else{
            out[mmap[mp(x[i],y[i])]] = i;
            mmap[mp(x[i],y[i])] = -1;
        }
    }
    for(auto & c : mmap){
        if(c.second != -1)out[c.second] = m;
    }
    solve();
    vector<int> res;
    for(int i = 0 ; i < q ; ++i)res.pb(::res[i] + n);
    return res;
}


#ifdef LOCAL
int main(int argc, char *argv[]) {
	int N, C, Q;
    freopen("A.INP","r",stdin);
    freopen("A.OUT","w",stdout);
	scanf("%d%d%d", &N, &C, &Q);
	std::vector<int> T(C), X(C), Y(C);
	for(int i = 0; i < C; i++) {
		scanf("%d%d%d", &T[i], &X[i], &Y[i]);
	}
	std::vector<int> W(Q), P(Q);
	for(int i = 0; i < Q; i++) {
		scanf("%d%d", &W[i], &P[i]);
	}
	auto res = simulateCollapse(N, T, X, Y, W, P);
	for(auto i : res) {
		printf("%d\n", i);
	}
}
#endif

Compilation message

collapse.cpp: In member function 'void Dsurollback::rollback(int)':
collapse.cpp:30:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(data.size() > sz){
               ~~~~~~~~~~~~^~~~
collapse.cpp: In function 'void solve()':
collapse.cpp:68:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(qe < norm.size() && y[norm[qe]] == i)Dsu.Merge(x[norm[qe]] , y[norm[qe]]),++qe;
                   ~~~^~~~~~~~~~~~~
collapse.cpp:69:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(qi < q.size() && p[q[qi]] == i){
                   ~~~^~~~~~~~~~
collapse.cpp:86:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(qe < norm.size() && x[norm[qe]] == i){
                   ~~~^~~~~~~~~~~~~
collapse.cpp:89:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(qi < q.size() && p[q[qi]] == i - 1){
                   ~~~^~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3704 KB Output is correct
2 Correct 8 ms 3320 KB Output is correct
3 Correct 10 ms 3320 KB Output is correct
4 Correct 11 ms 3320 KB Output is correct
5 Correct 47 ms 3704 KB Output is correct
6 Correct 140 ms 4216 KB Output is correct
7 Correct 9 ms 3320 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 55 ms 3832 KB Output is correct
10 Incorrect 111 ms 4088 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 7268 KB Output is correct
2 Correct 48 ms 7396 KB Output is correct
3 Execution timed out 15026 ms 14864 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 7268 KB Output is correct
2 Correct 52 ms 7340 KB Output is correct
3 Correct 67 ms 7724 KB Output is correct
4 Correct 87 ms 7800 KB Output is correct
5 Correct 533 ms 7988 KB Output is correct
6 Correct 2181 ms 8632 KB Output is correct
7 Execution timed out 15067 ms 25700 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3704 KB Output is correct
2 Correct 8 ms 3320 KB Output is correct
3 Correct 10 ms 3320 KB Output is correct
4 Correct 11 ms 3320 KB Output is correct
5 Correct 47 ms 3704 KB Output is correct
6 Correct 140 ms 4216 KB Output is correct
7 Correct 9 ms 3320 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 55 ms 3832 KB Output is correct
10 Incorrect 111 ms 4088 KB Output isn't correct
11 Halted 0 ms 0 KB -