oj.uz

Submission #204135

# Submission time Handle Problem Language Result Execution time Memory
204135 2020-02-24T14:06:45 Z LittleFlowers__ Coin Collecting (JOI19_ho_t4) C++14
8 / 100
 756 ms 8920 KB 
///https://oj.uz/problem/view/JOI19_ho_t4
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=100010,
          M=2010;

int n;
int lf[N][2],rt[N][2];
int x[N],y[N];

int bx[M],by[M],X[M],Y[M];
int a[M][M];
int q[N];
long long fx[M],fy[M];

int L(int i,int j){
    return lf[i][j]==i ? i : L(lf[i][j],j);
}
int R(int i,int j){
    return rt[i][j]==i ? i : R(rt[i][j],j);
}

int xx,yy,nn;

int calc(int i){
    int u,v,s,t,mx=1<<15;
    if(x[i]<1){
        u=R(1,0), v=R(1,1);
        if(u<=n+n){
            if(mx>u-x[i] + abs(1-y[i])){
                mx=u-x[i] + abs(1-y[i]);
                xx=u, yy=1;
            }
        }
        if(v<=n+n){
            if(mx>v-x[i] + abs(2-y[i])){
                mx=v-x[i] + abs(2-y[i]);
                xx=v, yy=1;
            }
        }
    } else if(x[i]>n+n){
        u=L(n,0), v=L(n,1);
        if(u>0){
            if(mx>x[i]-u + abs(1-y[i])){
                mx=x[i]-u + abs(1-y[i]);
                xx=u, yy=2;
            }
        }
        if(v>0){
            if(mx>x[i]-v + abs(2-y[i])){
                mx=x[i]-v + abs(2-y[i]);
                xx=v, yy=1;
            }
        }
    } else{
        u=L(x[i],0), v=L(x[i],1);
        if(u>0){
            if(mx>x[i]-u + abs(1-y[i])){
                mx=x[i]-u + abs(1-y[i]);
                xx=u, yy=2;
            }
        }
        if(v>0){
            if(mx>x[i]-v + abs(2-y[i])){
                mx=x[i]-v + abs(2-y[i]);
                xx=v, yy=1;
            }
        }
        u=R(x[i],0), t=R(x[i],1);
        if(u<=n+n){
            if(mx>u-x[i] + abs(1-y[i])){
                mx=u-x[i] + abs(1-y[i]);
                xx=u, yy=1;
            }
        }
        if(v<=n+n){
            if(mx>v-x[i] + abs(2-y[i])){
                mx=v-x[i] + abs(2-y[i]);
                xx=v, yy=1;
            }
        }
    }
    return mx;
}

struct pt{
    int x,y;
}p[N];

void fix(){
    int dt=1<<15;
    for(int i=1;i<=nn;++i) if(bx[i]==1)
        for(int j=1;j<=nn;++j) if(by[j]==0)
            if(dt>fx[i]+a[i][j]-fy[j]) dt=fx[i]+a[i][j]-fy[j];
    for(int i=1;i<=nn;++i) if(bx[i]==0) fx[i]+=dt;
    for(int i=1;i<=nn;++i) if(by[i]==0) fy[i]+=dt;
}

void upd(int v) {
    int u,k;
    while(v>0) {
        u=by[v];
        k=X[u];
        X[u]=v;
        Y[v]=u;
        v=k;
    }
}

int bfs(int i){
    int L,R;
    q[L=R=1]=i;
    memset( by, 0, sizeof(by));
    memset( bx, 0, sizeof(bx));
    bx[i]=1;
    while(L<=R) {
        int u=q[L++];
        for(int v=1;v<=nn;++v) if(by[v]==0 && fx[u]+a[u][v]-fy[v]==0) {
            by[v]=u;
            if(Y[v]==0) {
                upd(v);
                return true;
            }
            q[++R]=Y[v];
            bx[Y[v]]=1;
        }
    }
    return false;
}


main(){
    #define task "coincollecting"
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);

    n=in;
    forinc(i,1,n+n){
        x[i]=in,y[i]=in;
    }

    forinc(j,0,1)
        forinc(i,1,n+n) lf[i][j]=rt[i][j]=i;

    priority_queue<ii,vector<ii>,greater<ii>> q;

    forinc(i,1,n+n)
        q.push({calc(i),i});

    long long tot=0;
    while(q.size()>1000){
        ii u=q.top(); q.pop();
        int tmp=calc(u.se);
        if(u.fi!=calc(u.se)){
            q.push({tmp,u.se});
            continue;
        }
        lf[xx][yy-1]=xx-1;
        rt[xx][yy-1]=xx+1;
        tot+=tmp;
    }
    while(q.size()){
        int i=q.top().se; q.pop();
        p[++nn]={x[i],y[i]};
    }
    forinc(i,1,n){
        if(rt[i][0]==i)
            p[++nn]={i,1};
        if(rt[i][1]==i)
            p[++nn]={i,2};
    }
    nn/=2;
    forinc(i,1,nn)
        forinc(j,1,nn) a[i][j]=1<<15;
    forinc(i,1,nn)
        forinc(j,1,nn){
            a[i][j]=abs(p[i].x-p[j+nn].x) + abs(p[i].y-p[j+nn].y);
        }
    forinc(i,1,nn)
        while(!bfs(i)) fix();
    for(int i=1;i<=nn;++i){
        tot+=a[i][X[i]];
    }
    cout<<tot;
}

Compilation message

joi2019_ho_t4.cpp: In function 'int calc(int)':
joi2019_ho_t4.cpp:45:13: warning: unused variable 's' [-Wunused-variable]
     int u,v,s,t,mx=1<<15;
             ^
joi2019_ho_t4.cpp:45:15: warning: variable 't' set but not used [-Wunused-but-set-variable]
     int u,v,s,t,mx=1<<15;
               ^
joi2019_ho_t4.cpp: At global scope:
joi2019_ho_t4.cpp:151:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 69 ms 376 KB Output is correct
3 Correct 31 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 756 ms 504 KB Output is correct
6 Correct 238 ms 504 KB Output is correct
7 Correct 279 ms 504 KB Output is correct
8 Correct 243 ms 632 KB Output is correct
9 Correct 277 ms 504 KB Output is correct
10 Correct 433 ms 632 KB Output is correct
11 Correct 194 ms 504 KB Output is correct
12 Correct 303 ms 504 KB Output is correct
13 Correct 213 ms 632 KB Output is correct
14 Correct 212 ms 504 KB Output is correct
15 Correct 291 ms 632 KB Output is correct
16 Correct 272 ms 508 KB Output is correct
17 Correct 295 ms 632 KB Output is correct
18 Correct 231 ms 504 KB Output is correct
19 Correct 179 ms 504 KB Output is correct
20 Correct 178 ms 504 KB Output is correct
21 Correct 213 ms 504 KB Output is correct
22 Correct 197 ms 632 KB Output is correct
23 Correct 286 ms 504 KB Output is correct
24 Correct 228 ms 504 KB Output is correct
25 Correct 218 ms 632 KB Output is correct
26 Correct 178 ms 504 KB Output is correct
27 Correct 190 ms 504 KB Output is correct
28 Correct 229 ms 504 KB Output is correct
29 Correct 234 ms 504 KB Output is correct
30 Correct 234 ms 504 KB Output is correct
31 Correct 182 ms 380 KB Output is correct
32 Correct 170 ms 504 KB Output is correct
33 Correct 210 ms 504 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 69 ms 376 KB Output is correct
3 Correct 31 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 756 ms 504 KB Output is correct
6 Correct 238 ms 504 KB Output is correct
7 Correct 279 ms 504 KB Output is correct
8 Correct 243 ms 632 KB Output is correct
9 Correct 277 ms 504 KB Output is correct
10 Correct 433 ms 632 KB Output is correct
11 Correct 194 ms 504 KB Output is correct
12 Correct 303 ms 504 KB Output is correct
13 Correct 213 ms 632 KB Output is correct
14 Correct 212 ms 504 KB Output is correct
15 Correct 291 ms 632 KB Output is correct
16 Correct 272 ms 508 KB Output is correct
17 Correct 295 ms 632 KB Output is correct
18 Correct 231 ms 504 KB Output is correct
19 Correct 179 ms 504 KB Output is correct
20 Correct 178 ms 504 KB Output is correct
21 Correct 213 ms 504 KB Output is correct
22 Correct 197 ms 632 KB Output is correct
23 Correct 286 ms 504 KB Output is correct
24 Correct 228 ms 504 KB Output is correct
25 Correct 218 ms 632 KB Output is correct
26 Correct 178 ms 504 KB Output is correct
27 Correct 190 ms 504 KB Output is correct
28 Correct 229 ms 504 KB Output is correct
29 Correct 234 ms 504 KB Output is correct
30 Correct 234 ms 504 KB Output is correct
31 Correct 182 ms 380 KB Output is correct
32 Correct 170 ms 504 KB Output is correct
33 Correct 210 ms 504 KB Output is correct
34 Incorrect 732 ms 8920 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 69 ms 376 KB Output is correct
3 Correct 31 ms 376 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 756 ms 504 KB Output is correct
6 Correct 238 ms 504 KB Output is correct
7 Correct 279 ms 504 KB Output is correct
8 Correct 243 ms 632 KB Output is correct
9 Correct 277 ms 504 KB Output is correct
10 Correct 433 ms 632 KB Output is correct
11 Correct 194 ms 504 KB Output is correct
12 Correct 303 ms 504 KB Output is correct
13 Correct 213 ms 632 KB Output is correct
14 Correct 212 ms 504 KB Output is correct
15 Correct 291 ms 632 KB Output is correct
16 Correct 272 ms 508 KB Output is correct
17 Correct 295 ms 632 KB Output is correct
18 Correct 231 ms 504 KB Output is correct
19 Correct 179 ms 504 KB Output is correct
20 Correct 178 ms 504 KB Output is correct
21 Correct 213 ms 504 KB Output is correct
22 Correct 197 ms 632 KB Output is correct
23 Correct 286 ms 504 KB Output is correct
24 Correct 228 ms 504 KB Output is correct
25 Correct 218 ms 632 KB Output is correct
26 Correct 178 ms 504 KB Output is correct
27 Correct 190 ms 504 KB Output is correct
28 Correct 229 ms 504 KB Output is correct
29 Correct 234 ms 504 KB Output is correct
30 Correct 234 ms 504 KB Output is correct
31 Correct 182 ms 380 KB Output is correct
32 Correct 170 ms 504 KB Output is correct
33 Correct 210 ms 504 KB Output is correct
34 Incorrect 732 ms 8920 KB Output isn't correct
35 Halted 0 ms 0 KB -