oj.uz

답안 #1084242

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084242 2024-09-05T17:03:38 Z Tymond 슈퍼트리 잇기 (IOI20_supertrees) C++17
0 / 100
 1000 ms 1051196 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

const int MAXN = 1e3 + 7;
int vis[MAXN];
int p[MAXN][MAXN];
int n;
vector<vi> ans;

vi akt;
map<int, int> cnt;
void getOthers(int v){
    queue<int> q;
    q.push(v);
    vis[v] = 1;
    while(sz(q)){
        cnt[v] = 1;
        akt.pb(v);
        for(int i = 0; i < n; i++){
            if(i != v && p[v][i] > 0 && !vis[i]){
                vis[i] = 1;
                q.push(i);
            }
        }
    }
}

int construct(vector<vi> given) {
    n = sz(given);
    ans.resize(n);
    for(int i = 0; i < n; i++){
        ans[i].assign(n, 0);
        for(int j = 0; j < n; j++){
            p[i][j] = given[i][j];
        }
    }

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(!vis[i]){
                akt.clear();
                cnt.clear();
                getOthers(i);

                int mx = 0;
                for(auto ele : akt){
                    for(int x = 0; x < n; x++){
                        if(x != ele && p[ele][x] == 0 && cnt[x]){
                            return 0;
                        }
                        if(cnt[x]){
                            mx = max(mx, p[ele][x]);
                        }
                    }
                }

                if(mx == 1){
                    for(int i = 0; i < sz(akt) - 1; i++){
                        ans[akt[i]][akt[i + 1]] = 1;
                        ans[akt[i + 1]][akt[i]] = 1;
                    }
                    continue;
                }


            }
        }
    }


    build(ans);
    return 1;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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