oj.uz

Submission #282980

# Submission time Handle Problem Language Result Execution time Memory
282980 2020-08-25T08:08:20 Z khangal Simurgh (IOI17_simurgh) C++14
0 / 100
 3000 ms 29344 KB 
#include<bits/stdc++.h>
#include "simurgh.h"

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void dfs(int x , vector<vector<int>> &v){
    used[x]=1;
    for(auto u:v[x]){
        if(used[u]==0)
            dfs(u,v);
    }
}
vector<int> find_roads(int n, vector<int> U, vector<int> V){
    m=U.size();
    // for(int i=0;i<m;i++){
    //     v[U[i]].pb(V[i]);
    //     v[V[i]].pb(U[i]);
    // }
    vector<int> permutation(m,0);
    vector<int> ans={};
    for(int i=m-n+1;i<m;i++){
        permutation[i]=1;
    }
    do{ 
        vector<int> vec;
        vector<vector<int>> v(n);
        for(int i=0;i<n;i++)used[i]=0;
        for(int i=0;i<m;i++){
            if(permutation[i]==1){vec.pb(i);v[U[i]].pb(V[i]);v[V[i]].pb(U[i]);}
        }
        for(int i=0;i<n;i++){
            if(used[i]==0){
                dfs(i,v);
                cnt++;
            }
        }
        if(cnt>1){
            continue;
        }
        x = count_common_roads(vec);
        if(x==n-1){
            ans = vec;
            return ans;
        }
    }while(next_permutation(permutation.begin(),permutation.end()));
    return ans;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 29344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 29344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 29344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 29312 KB correct
2 Execution timed out 3080 ms 29312 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 76 ms 29344 KB WA in grader: NO
2 Halted 0 ms 0 KB -