제출 #41747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41747		RockyB	Amusement Park (JOI17_amusement_park)	C++14	0 / 100	34 ms	26704 KiB

Joi

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
#include "Joi.h"

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

vector <int> g[N];

bool was[N];
vector <int> cmp;
void dfs(int v) {
	was[v] = 1;
	cmp.pb(v);
	for (auto to : g[v]) {
		if (!was[to]) dfs(to);
	}
}
void Joi(int n, int m, int a[], int b[], ll x, int T) {
	for (int i = 0; i < m; i++) {
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0);
	for (int i = 0; i < 60; i++) {
		if (x & (1LL << i)) MessageBoard(cmp[i], 1);
		else MessageBoard(cmp[i], 0);
	}
}

#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif

Ioi

/// In The Name Of God

#include "Ioi.h"
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

vector <int> g[N];

bool was[N];
vector <int> cmp;
void dfs(int v) {
	was[v] = 1;
	cmp.pb(v);
	for (auto to : g[v]) {
		if (!was[to]) dfs(to);
	}
}
int last;
bool found;
void dfs1(int v, int p = -1) {
	was[v] = 1;
	if (v == cmp[0] || found) {
		found = 1;
		return;
	}
	for (auto to : g[v]) {
		if (!was[to] && !found) {
			last = Move(to);
			dfs1(to, v);
		}
	}
	if (!found) {
		last = Move(p); 
	}
}
ll Ioi(int n, int m, int a[], int b[], int p, int v, int t) {
	for (int i = 0; i < m; i++) {
		g[a[i]].pb(b[i]);
		g[b[i]].pb(a[i]);
	}
	dfs(0);
	memset(was, 0, sizeof(was));
	dfs1(1);
	ll res = 0;
	for (int i = 0; i < 59; i++) {
		res += (1LL << i) * last;
		last = Move(cmp[i + 1]);
	}
	return res;
}	

#ifdef IOI2018
int main() {
	freopen ("in.txt", "r", stdin);
	
	ioi
}
#endif

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17