oj.uz

Submission #1011059

# Submission time Handle Problem Language Result Execution time Memory
1011059 2024-06-29T18:08:27 Z c2zi6 Simurgh (IOI17_simurgh) C++14
13 / 100
 47 ms 592 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;
/*bool dfs(int u = 0, int p = -1) {*/
/*    vis[u] = true;*/
/*    for (int v : gp[u]) if (v != p) {*/
/*        if (vis[v]) return false;*/
/*        if (!dfs(v, u)) return false;*/
/*    }*/
/*    return true;*/
/*}*/
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();
    int q = 0;
    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);
        q++;
        assert(q <= 30000);
        if (count_common_roads(ret) == n-1) return ret;
    }
    return VI();
}

Compilation message

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

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 43 ms 412 KB correct
3 Correct 47 ms 592 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 4 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 436 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 344 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 19 ms 440 KB correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 43 ms 412 KB correct
3 Correct 47 ms 592 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 4 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 436 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 344 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 19 ms 440 KB correct
14 Incorrect 1 ms 344 KB WA in grader: NO
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 43 ms 412 KB correct
3 Correct 47 ms 592 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 4 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 436 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 344 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 19 ms 440 KB correct
14 Incorrect 1 ms 344 KB WA in grader: NO
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Incorrect 0 ms 348 KB WA in grader: NO
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 348 KB correct
2 Correct 43 ms 412 KB correct
3 Correct 47 ms 592 KB correct
4 Correct 1 ms 348 KB correct
5 Correct 0 ms 348 KB correct
6 Correct 4 ms 348 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 348 KB correct
9 Correct 0 ms 436 KB correct
10 Correct 1 ms 348 KB correct
11 Correct 0 ms 344 KB correct
12 Correct 1 ms 348 KB correct
13 Correct 19 ms 440 KB correct
14 Incorrect 1 ms 344 KB WA in grader: NO
15 Halted 0 ms 0 KB -