Submission #596244

#	Time	Username	Problem	Language	Result	Execution time	Memory
596244		Mohammed_Atalah	Simurgh (IOI17_simurgh)	C++17	0 / 100	1 ms	300 KiB

simurgh

// Template path: /home/mohammed/.config/sublime-text-3/Packages/User

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vecint;
typedef vector<char> vecchar;
typedef vector<string> vecstr;
typedef vector<long long> vecll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

// Marcos
#define endl ("\n")
// #define int long long
#define mod 1000000007
#define pi (3.141592653589)
#define REP(i,a,b) for (int i = a; i < b; i++)
#define RREP(i,a,b) for (int i = a; i > b; i--)
#define PFD(n) cout.precision(n) // PFN == Print Full Double
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

// Functions
long long squared(long long x) {return (x * x) % mod;}
int factorial(int n) {long long res = 1; for (int i = 1; i <= n; i++) {res = ((res * i) % mod + mod) % mod ;} return res;}
long long power(long long x, long long p) {if (p == 0) {return 1;} if (p % 2 == 1) {return (power(x, p - 1) * x) % mod;} return squared(power(x, p / 2));}


#include "simurgh.h"

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	int sz = u.size();
	vector<int> vv;
	for (int i = 0 ; i < n - 1; i++) {
		vv.push_back(0);
	}
	bool golden = false;
	int e = count_common_roads(vv);
	vector<int> result;
	if (e == n - 1) {
		golden = true;
		result.push_back(0);
	}

	for (int i = 1 ; i < sz; i++) {
		vv[0] = i;
		int w = count_common_roads(vv);
		if (golden) {
			if (w == n - 1) {
				result.push_back(i);
			}
		} else {
			if (w == 1) {
				result.push_back(i);
			}
		}
	}

	return result;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 17
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30