oj.uz

Submission #314629

# Submission time Handle Problem Language Result Execution time Memory
314629 2020-10-20T13:23:59 Z anakib1 Simurgh (IOI17_simurgh) C++17
13 / 100
 3000 ms 384 KB 
//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>
#include <cassert>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
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);
    }
};
#include "simurgh.h"
int nn, mm;
vector<pii> ed;
vi ans;
void rec(vi tree, int xx) {
    if (sz(tree) == nn - 1) {
        vi p(nn); iota(all(p), 0);
        function<int(int)> f = [&](int x) {if (p[x] == x) return x; return p[x] = f(p[x]); };
        function<int(int, int)> un = [&](int x, int y) {x = f(x); y = f(y); if (x == y)return 0; if (rand() & 1) swap(x, y); p[x] = y; return 1; };
        for (auto x : tree) un(ed[x].first, ed[x].second);
        set<int> a; rngi(i, nn) a.insert(f(i));
        if (sz(a) != 1) return;
        if (count_common_roads(tree) == nn - 1) ans = tree;
        return;
    }
    for (int i = xx; i < mm; i++) {
        tree.push_back(i);
        rec(tree, i + 1);
        tree.pop_back();
    }
}
std::vector<int> find_roads(int N, std::vector<int> u, std::vector<int> v) {
    mm = sz(u), nn = N;
    rngi(i, mm) ed.push_back({ u[i], v[i] });
    rec(vi(), 0);
    return ans;
}


/*
4 6
0 1
0 2
0 3
1 2
1 3
2 3
0 1 5
*/

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 256 KB correct
2 Correct 41 ms 256 KB correct
3 Correct 41 ms 360 KB correct
4 Correct 2 ms 256 KB correct
5 Correct 1 ms 376 KB correct
6 Correct 7 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 0 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 2 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 3 ms 384 KB correct
13 Correct 41 ms 256 KB correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 256 KB correct
2 Correct 41 ms 256 KB correct
3 Correct 41 ms 360 KB correct
4 Correct 2 ms 256 KB correct
5 Correct 1 ms 376 KB correct
6 Correct 7 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 0 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 2 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 3 ms 384 KB correct
13 Correct 41 ms 256 KB correct
14 Execution timed out 3097 ms 384 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 256 KB correct
2 Correct 41 ms 256 KB correct
3 Correct 41 ms 360 KB correct
4 Correct 2 ms 256 KB correct
5 Correct 1 ms 376 KB correct
6 Correct 7 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 0 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 2 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 3 ms 384 KB correct
13 Correct 41 ms 256 KB correct
14 Execution timed out 3097 ms 384 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 256 KB correct
2 Correct 41 ms 256 KB correct
3 Correct 41 ms 360 KB correct
4 Correct 2 ms 256 KB correct
5 Correct 1 ms 376 KB correct
6 Correct 7 ms 256 KB correct
7 Correct 0 ms 256 KB correct
8 Correct 0 ms 256 KB correct
9 Correct 1 ms 256 KB correct
10 Correct 2 ms 256 KB correct
11 Correct 0 ms 256 KB correct
12 Correct 3 ms 384 KB correct
13 Correct 41 ms 256 KB correct
14 Execution timed out 3097 ms 384 KB Time limit exceeded
15 Halted 0 ms 0 KB -