oj.uz

Submission #1005411

# Submission time Handle Problem Language Result Execution time Memory
1005411 2024-06-22T12:15:47 Z vjudge1 Party (POI11_imp) C++17
9 / 100
 3000 ms 14928 KB 
#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
int n,m;
vector<int>v[3005];
bitset<3005>curr,mat[3005],vis;
int cnt=0;
void rec(int x){
    if(cnt==n/3){
        for(int i=0;i<3005;i++){
            if(curr[i]==1) co i<<' ';
        }
        exit(0);
    }
    if(x==n) return;
    if(n-x+cnt<n/3) return ;
    if((curr&mat[x])==curr){
        curr[x]=1;
        cnt++;
        rec(x+1);
        cnt--;
        curr[x]=0;
    }
    rec(x+1);
    return;
}
void rec1(ll x){
    if(x==n/3){
        for(int i=0;i<3005;i++){
            if(curr[i]==1) co i<<' ';
        }
        exit(0);
    }
    ll num=rand()%n+1;
    while(vis[num]||(curr&mat[num])!=curr) num=rand()%n+1;
    vis[num]=1;
    curr[num]=1;
    rec1(x+1);
    curr[num]=0;
    vis[num]=0;
}
void solve(){
    cin>>n>>m;
    for(int i=0;i<m;i++){
        ll a,b;
        cin>>a>>b;
        mat[a][b]=1;
        mat[b][a]=1;
    }
    if(n<=20) rec(0);
    else while(1) rec1(0);
}
int main()
{
    suiii
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 30 ms 856 KB Output is correct
3 Correct 32 ms 2652 KB Output is correct
4 Execution timed out 3012 ms 2640 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 604 KB Output is correct
2 Correct 78 ms 1064 KB Output is correct
3 Correct 85 ms 4944 KB Output is correct
4 Correct 76 ms 5144 KB Output is correct
5 Correct 83 ms 4900 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 856 KB Output is correct
2 Execution timed out 3049 ms 6676 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1108 KB Output is correct
2 Correct 152 ms 8652 KB Output is correct
3 Execution timed out 3043 ms 8108 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 1364 KB Output is correct
2 Execution timed out 3069 ms 1372 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 1612 KB Output is correct
2 Correct 245 ms 1620 KB Output is correct
3 Correct 219 ms 12628 KB Output is correct
4 Execution timed out 3063 ms 12564 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 1680 KB Output is correct
2 Execution timed out 3058 ms 14928 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 1872 KB Output is correct
2 Execution timed out 3063 ms 1836 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 1880 KB Output is correct
2 Execution timed out 3073 ms 1628 KB Time limit exceeded
3 Halted 0 ms 0 KB -