oj.uz

답안 #472480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
472480 2021-09-13T15:58:21 Z Blobo2_Blobo2 Political Development (BOI17_politicaldevelopment) C++14
0 / 100
 3000 ms 4520 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")

#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);
#define EPS 0.00000001

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}
int now=-1;
vector<int>adj[50001];
set<int>st[50001];
/*bool vis[50001];
vector<int>path;
void dfs(int u){
    if(path.size()+1 == now){
        cout<<now<<endl;
        exit(0);
    }
    vis[u] = 1;
    path.push_back(u);
    for(auto v:adj[u]){
        if(!vis[v]){
            bool iwillgothere = 1;
            for(int i=0;i<path.size();i++){
                if(st[path[i]].find(v) != st[path[i]].end());
                else iwillgothere&=0;
            }
            if(iwillgothere)
                dfs(v);
        }
    }
    path.pop_back();
}*/
signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    //freopen("in.txt","r",stdin);

    int n=nxt(),k=nxt();
    for(int i=0;i<n;i++){
        int sz = nxt();
        for(int j=0;j<sz;j++){
            int x=nxt();
            adj[i].push_back(x);
            st[i].insert(x);
        }
    }
    int ans = -1;
    int arr[n];
    for(int i=0;i<n;i++)arr[i] = i;
    for(ans = k;ans>=1;ans--){
        int limit = 60000;
        while(limit--){
            random_device rd;
            mt19937 g(rd());
            shuffle(arr,arr+n,g);
            for(int i=0;i<ans;i++){
                for(int j =i+1;j<ans;j++){
                    if(st[arr[i]].find(arr[j]) == st[arr[i]].end())
                        goto a;
                }
            }
            cout<<ans<<endl;
            return 0;
            a:;
        }
    }
    return 0;
}

Compilation message

politicaldevelopment.cpp:21:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   21 | const int mo=1e9+7,INF=1e18;
      |                        ^~~~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 940 ms 4428 KB Output is correct
4 Correct 227 ms 4492 KB Output is correct
5 Correct 32 ms 4520 KB Output is correct
6 Correct 139 ms 4496 KB Output is correct
7 Correct 70 ms 4504 KB Output is correct
8 Execution timed out 3052 ms 3788 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 940 ms 4428 KB Output is correct
4 Correct 227 ms 4492 KB Output is correct
5 Correct 32 ms 4520 KB Output is correct
6 Correct 139 ms 4496 KB Output is correct
7 Correct 70 ms 4504 KB Output is correct
8 Execution timed out 3052 ms 3788 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3038 ms 3788 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 940 ms 4428 KB Output is correct
4 Correct 227 ms 4492 KB Output is correct
5 Correct 32 ms 4520 KB Output is correct
6 Correct 139 ms 4496 KB Output is correct
7 Correct 70 ms 4504 KB Output is correct
8 Execution timed out 3052 ms 3788 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3788 KB Output is correct
2 Correct 3 ms 3788 KB Output is correct
3 Correct 940 ms 4428 KB Output is correct
4 Correct 227 ms 4492 KB Output is correct
5 Correct 32 ms 4520 KB Output is correct
6 Correct 139 ms 4496 KB Output is correct
7 Correct 70 ms 4504 KB Output is correct
8 Execution timed out 3052 ms 3788 KB Time limit exceeded
9 Halted 0 ms 0 KB -