oj.uz

Submission #382397

# Submission time Handle Problem Language Result Execution time Memory
382397 2021-03-27T08:34:13 Z mehrdad_sohrabi Parachute rings (IOI12_rings) C++14
52 / 100
 1852 ms 107116 KB 
#include <bits/stdc++.h>
/// 500 485 462 A4
using namespace std;
typedef int ll;
typedef complex<double> point;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
//#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
#define inbuf_len 1 << 16
#define outbuf_len 1 << 16
const int MAXN=1e6+100;
map <pii,int> mp;
vector <int> g[MAXN];
ll vis[MAXN];
vector <int> dig;
ll td=0;
ll p1=1;
ll ans=MAXN;
ll t4=0;
ll hazf[MAXN];
ll tool=0;
ll n;
ll ch[MAXN];
ll cnt=0;
vector <int> W;
ll par[MAXN];
ll dor[MAXN];
void del(ll v){
    for (int i=0;i<n;i++){
        vector <int> a;
        for (auto u : g[i]) if (u!=v) a.pb(u);
        g[i]=a;
    }
    g[v].clear();
    hazf[v]=1;
}
void Init(ll N){
    n=N;
    ans=n;
    for (int i=0;i<N;i++){
        par[i]=i;
    }
}
ll getpar(ll v){
    if (par[v]==v) return v;
    return par[v]=getpar(par[v]);
}
void rebuild(){
    for (int i=0;i<MAXN;i++){
        par[i]=i;
    }
    ans=1;
    for (int i=0;i<n;i++) if (g[i].size()>2) p1=0;
    for (int v=0;v<n;v++){
        for (auto u : g[v]){
            if (u>v){
                ll u1=getpar(u);
                ll v1=getpar(v);
                if (u1==v1){
                    p1=0;
                }
                par[u1]=v1;
            }
        }
    }
}
ll pa[MAXN];
ll hi[MAXN];
ll dd(ll v,ll p){
    if (dor[v]==1) return v;
    for (auto u : g[v]){
        if (u==p) continue;
        return dd(u,v);
    }
}
void dfs(ll v,ll p){
    vis[v]=1;
    hi[v]=hi[p]+1;
    pa[v]=p;
    for (auto u : g[v]){
        if (u==p) continue;
        if (vis[u]==1 && hi[u]>hi[v]){
            ll z=u;
            while(z!=v){
                ch[z]++;
                tool++;
                dor[z]=1;
                if (ch[z]==cnt) ans++,W.pb(z);
                z=pa[z];
            }
            tool++;
            dor[v]=1;
            ch[v]++;
            if (ch[v]==cnt) ans++,W.pb(v);
            continue;
        }
        if (vis[u]) continue;
        dfs(u,v);
    }
}
void Link(int A, int B) {
    if (p1==0 || ans==0) return ;
    if (hazf[A] || hazf[B]) return ;
    g[A].pb(B);
    g[B].pb(A);
    mp[{A,B}]=1;
    mp[{B,A}]=1;
    if (t4==1){
        if (getpar(A)==getpar(B)) p1=0;
    }
    if (p1==0) return ;
//        cout << "GOOOZ" << endl;
    if (t4==1 && (g[A].size()>2 || g[B].size()>2)){
        p1=0;
        return ;
    }
    if (g[A].size()>3){
        del(A);
        rebuild();
    }
    if (g[B].size()>3){
        del(A);
        rebuild();
    }
    if (getpar(A)==getpar(B)){
     //  cout << "GOOZ" << endl;
        if (td==0){
            td++;
            ans=0;
            W.clear();
            cnt++;
            for (int i=0;i<n;i++){
                if (vis[i]==0) dfs(i,i);
            }
        }
        else if (td==1 && t4==0){

            if (dor[A]==1 && dor[B]==1){
                cnt++;
                W.clear();
                ans=0;
                ch[A]++;
                if (ch[A]==cnt) ans++;
                ch[B]++;
                if (ch[B]==cnt) ans++;
          //      cout << ans << " erij " << endl;
            }
            else if (dor[A]==1){
                ll z=dd(B,A);
                if (mp[{z,A}]){
                    ans=0;
                    ch[A]++;
                    cnt++;
                    if (ch[A]==cnt) ans++;
                    ch[z]++;
                    if (ch[z]==cnt) ans++;
                }
                else p1=0;
            }
            else if (dor[B]==1){
                ll z=dd(A,B);
                if (mp[{z,B}]){
                    ans=0;
                    ch[B]++;
                    cnt++;
                    if (ch[B]==cnt) ans++;
                    ch[z]++;
                    if (ch[z]==cnt) ans++;
                }
                else p1=0;
            }
            else p1=0;
        }
    }
    else{
        par[par[A]]=par[B];
    }
    if (g[B].size()==3){
    //    cout << "NR " << B << endl;
        cnt++;
        ans=0;
        W.clear();
        for (auto u : g[B]){
            ch[u]++;
            if (ch[u]==cnt) {
                ans++;
                W.pb(u);
       //         cout << u << " RAS " << endl;
            }
        }
        ch[B]++;
       // cout << ch[B] << " ascw" << endl;
        if (ch[B]==cnt) W.pb(B),ans++;
    }
    if (g[A].size()==3){
    //    cout << " iurfrg " << endl;
        cnt++;
        ans=0;
        W.clear();
        for (auto u : g[A]){
            ch[u]++;
            if (ch[u]==cnt) {
                ans++;
                W.pb(u);
            }
        }
        ch[A]++;
        if (ch[A]==cnt) W.pb(A),ans++;
    }

}

int CountCritical() {
    if (p1==0) return 0;
    if (t4) return 1;
    return ans;
}

/*
int main() {
  int tmp;

  char *inbuf, *outbuf;
  inbuf = (char*) malloc(inbuf_len * sizeof(char));
  outbuf = (char*) malloc(outbuf_len * sizeof(char));
  tmp = setvbuf(stdin, inbuf, _IOFBF, inbuf_len);
  tmp = setvbuf(stdout, outbuf, _IOFBF, outbuf_len);

  int N, L;
  tmp = scanf("%d %d", &N, &L);
  assert(tmp == 2);
  Init(N);

  int i;
  for (i = 0; i < L; i++) {
    int A, B;
    tmp = scanf("%d", &A);
    if (A == -1) {
      int critical;
      critical = CountCritical();
      printf("%d ans\n", critical);
    } else {
      tmp = scanf("%d", &B);
      assert(tmp == 1);
      Link(A, B);
    }
  }

  return 0;

}
*/

Compilation message

rings.cpp: In function 'll dd(ll, ll)':
rings.cpp:82:1: warning: control reaches end of non-void function [-Wreturn-type]
   82 | }
      | ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 24 ms 28396 KB Output is correct
3 Correct 23 ms 28524 KB Output is correct
4 Correct 17 ms 24044 KB Output is correct
5 Correct 17 ms 24556 KB Output is correct
6 Correct 21 ms 25196 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 20 ms 24556 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 21 ms 24684 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1852 ms 107116 KB Output is correct
2 Incorrect 1285 ms 80364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 24 ms 28396 KB Output is correct
3 Correct 23 ms 28524 KB Output is correct
4 Correct 17 ms 24044 KB Output is correct
5 Correct 17 ms 24556 KB Output is correct
6 Correct 21 ms 25196 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 20 ms 24556 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 21 ms 24684 KB Output is correct
11 Correct 21 ms 24812 KB Output is correct
12 Correct 29 ms 25640 KB Output is correct
13 Correct 31 ms 29548 KB Output is correct
14 Correct 24 ms 28652 KB Output is correct
15 Correct 23 ms 28396 KB Output is correct
16 Correct 28 ms 25708 KB Output is correct
17 Correct 20 ms 24172 KB Output is correct
18 Correct 19 ms 24172 KB Output is correct
19 Correct 28 ms 25708 KB Output is correct
20 Correct 28 ms 25452 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 24 ms 28396 KB Output is correct
3 Correct 23 ms 28524 KB Output is correct
4 Correct 17 ms 24044 KB Output is correct
5 Correct 17 ms 24556 KB Output is correct
6 Correct 21 ms 25196 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 20 ms 24556 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 21 ms 24684 KB Output is correct
11 Correct 21 ms 24812 KB Output is correct
12 Correct 29 ms 25640 KB Output is correct
13 Correct 31 ms 29548 KB Output is correct
14 Correct 24 ms 28652 KB Output is correct
15 Correct 23 ms 28396 KB Output is correct
16 Correct 28 ms 25708 KB Output is correct
17 Correct 20 ms 24172 KB Output is correct
18 Correct 19 ms 24172 KB Output is correct
19 Correct 28 ms 25708 KB Output is correct
20 Correct 28 ms 25452 KB Output is correct
21 Correct 61 ms 28396 KB Output is correct
22 Correct 103 ms 30956 KB Output is correct
23 Correct 123 ms 33004 KB Output is correct
24 Correct 114 ms 34796 KB Output is correct
25 Correct 34 ms 28652 KB Output is correct
26 Correct 146 ms 39788 KB Output is correct
27 Correct 184 ms 36460 KB Output is correct
28 Correct 43 ms 25964 KB Output is correct
29 Correct 41 ms 24940 KB Output is correct
30 Correct 290 ms 42904 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 24 ms 28396 KB Output is correct
3 Correct 23 ms 28524 KB Output is correct
4 Correct 17 ms 24044 KB Output is correct
5 Correct 17 ms 24556 KB Output is correct
6 Correct 21 ms 25196 KB Output is correct
7 Correct 16 ms 23916 KB Output is correct
8 Correct 20 ms 24556 KB Output is correct
9 Correct 22 ms 24684 KB Output is correct
10 Correct 21 ms 24684 KB Output is correct
11 Correct 1852 ms 107116 KB Output is correct
12 Incorrect 1285 ms 80364 KB Output isn't correct
13 Halted 0 ms 0 KB -