oj.uz

답안 #1011078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011078 2024-06-29T18:35:37 Z c2zi6 Simurgh (IOI17_simurgh) C++14
0 / 100
 0 ms 348 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "simurgh.h"

int n;

VVI gp;
VI vis;
void dfs(int u = 0) {
    vis[u] = true;
    for (int v : gp[u]) if (!vis[v]) dfs(v);
}

bool istree(VPI edges) {
    gp = VVI(n);
    vis = VI(n);
    for (auto[u, v] : edges) {
        gp[u].pb(v);
        gp[v].pb(u);
    }
    dfs();
    rep(u, n) if (!vis[u]) return false;
    return true;
}

VI find_roads(int N, VI u, VI v) {
    n = N;
    int m = u.size();
    if (n <= 4) {
        rep(s, 1<<m) {
            int cnt = 0;
            rep(i, m) if (s & (1<<i)) cnt++;
            if (cnt != n-1) continue;
            VPI edges;
            rep(i, m) if (s & (1<<i)) edges.pb({u[i], v[i]});
            if (!istree(edges)) continue;
            VI ret;
            rep(i, m) if (s & (1<<i)) ret.pb(i);
            if (count_common_roads(ret) == n-1) return ret;
        }
    } else if (m == n*(n-1)/2) {
        VI core;
        rep(i, n-2) core.pb(i);
        VI val(m);
        int mx = -2e9;
        replr(i, n-2, m-1) {
            core.pb(i);
            val[i] = count_common_roads(core);
            setmax(mx, val[i]);
            core.pop_back();
        }
        int cnt = 0;
        replr(i, n-2, m-1) {
            cnt += (val[i] = (val[i] == mx));
        }
        if (cnt == n-1) {
            VI ret;
            rep(i, m) if (val[i]) ret.pb(i);
            return ret;
        }
        core = VI();
        mx = 1;
        replr(i, n-2, n-2 + n-2 - 1) {
            core.pb(i);
            mx += val[i];
        }
        rep(i, n-2) {
            core.pb(i);
            val[i] = (count_common_roads(core) == mx);
            core.pop_back();
        }
        VI ret;
        rep(i, m) if (val[i]) ret.pb(i);
        /*for (int x : ret) cout << x << " "; cout << endl;*/
        return ret;
        /*for (int x : val) cout << x << " "; cout << endl;*/
    }
    return VI();
}

Compilation message

simurgh.cpp: In function 'bool istree(VPI)':
simurgh.cpp:46:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |     for (auto[u, v] : edges) {
      |              ^

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB correct
2 Incorrect 0 ms 348 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB WA in grader: NO
2 Halted 0 ms 0 KB -