oj.uz

Submission #350949

# Submission time Handle Problem Language Result Execution time Memory
350949 2021-01-19T10:07:54 Z juggernaut Parachute rings (IOI12_rings) C++14
0 / 100
 4000 ms 42860 KB 
#ifndef EVAL
#include"grader.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
vector<int>g[1000005];
bool on[1000005],vis[1000005];
int n,deg[1000005];
int counter[5];
bool flag;
int cycle_size,cycle_number;
void update_counter(int x,int y){
    counter[min(x,4)]+=y;
}
#define DEBUG(x) cout<<#x<<"="<<x<<"\n"
void go(int v,int p){
    if(on[v])return;
    cycle_size++;
    vis[v]=1;
    for(int to:g[v])if(to!=p){
        if(vis[to]){
            flag=true;
            continue;
        }
        go(to,v);
    }
}
bool check(){
    for(int i=0;i<n;i++)vis[i]=0;
    for(int i=0;i<n;i++){
        if(on[i])continue;
        if(deg[i]>2)return false;
        if(vis[i])continue;
        flag=false;
        go(i,i);
        if(flag)return false;
    }
    return true;
}
void Init(int N){
    n=N;
    counter[0]=n;
}
void Link(int x,int y){
    g[x].push_back(y);
    g[y].push_back(x);
    update_counter(deg[x],-1);
    update_counter(deg[y],-1);
    deg[x]++;
    deg[y]++;
    update_counter(deg[x],+1);
    update_counter(deg[y],+1);
}
int CountCritical(){
    if(counter[4]){
        if(counter[4]!=1)return 0;
        for(int i=0;i<n;i++)
            if(deg[i]>3){
                on[i]=true;
                for(int to:g[i])deg[i]--,deg[to]--;
                int ans=check();
                for(int to:g[i])deg[i]++,deg[to]++;
                on[i]=false;
                return ans;
            }
    }else if(counter[3]){
        int ans=0;
        for(int i=0;i<n;i++)
            if(deg[i]>2){
                on[i]=true;
                for(int to:g[i])deg[i]--,deg[to]--;
                ans+=check();
                for(int to:g[i])deg[i]++,deg[to]++;
                on[i]=false;
                if(counter[3]==1)
                    for(int to:g[i]){
                        on[to]=true;
                        for(int to2:g[to])deg[to]--,deg[to2]--;
                        ans+=check();
                        for(int to2:g[to])deg[to]++,deg[to2]++;
                        on[to]=false;
                    }
            }
        return ans;
    }else{
        int cnt=0;
        for(int i=0;i<n;i++){
            on[i]=true;
            for(int to:g[i])deg[i]--,deg[to]--;
            cnt+=check();
            for(int to:g[i])deg[i]++,deg[to]++;
            on[i]=false;
        }
        return cnt;
    }
}
/*
7 13
-1
1 2
-1
0 5
-1
2 0
-1
3 2
-1
3 5
-1
4 3
-1

*/

Compilation message

rings.cpp: In function 'int CountCritical()':
rings.cpp:96:1: warning: control reaches end of non-void function [-Wreturn-type]
   96 | }
      | ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 17 ms 24044 KB Output is correct
3 Correct 18 ms 24044 KB Output is correct
4 Correct 25 ms 23916 KB Output is correct
5 Correct 189 ms 24172 KB Output is correct
6 Correct 649 ms 24268 KB Output is correct
7 Correct 15 ms 23916 KB Output is correct
8 Correct 74 ms 24172 KB Output is correct
9 Correct 17 ms 24044 KB Output is correct
10 Incorrect 17 ms 24044 KB Output isn't correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4098 ms 42860 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 17 ms 24044 KB Output is correct
3 Correct 18 ms 24044 KB Output is correct
4 Correct 25 ms 23916 KB Output is correct
5 Correct 189 ms 24172 KB Output is correct
6 Correct 649 ms 24268 KB Output is correct
7 Correct 15 ms 23916 KB Output is correct
8 Correct 74 ms 24172 KB Output is correct
9 Correct 17 ms 24044 KB Output is correct
10 Incorrect 17 ms 24044 KB Output isn't correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 17 ms 24044 KB Output is correct
3 Correct 18 ms 24044 KB Output is correct
4 Correct 25 ms 23916 KB Output is correct
5 Correct 189 ms 24172 KB Output is correct
6 Correct 649 ms 24268 KB Output is correct
7 Correct 15 ms 23916 KB Output is correct
8 Correct 74 ms 24172 KB Output is correct
9 Correct 17 ms 24044 KB Output is correct
10 Incorrect 17 ms 24044 KB Output isn't correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 17 ms 24044 KB Output is correct
3 Correct 18 ms 24044 KB Output is correct
4 Correct 25 ms 23916 KB Output is correct
5 Correct 189 ms 24172 KB Output is correct
6 Correct 649 ms 24268 KB Output is correct
7 Correct 15 ms 23916 KB Output is correct
8 Correct 74 ms 24172 KB Output is correct
9 Correct 17 ms 24044 KB Output is correct
10 Incorrect 17 ms 24044 KB Output isn't correct