이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt") // bit manipulation
#pragma GCC target("movbe") // byte swap
#pragma GCC target("aes,pclmul,rdrnd") // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2")
typedef long long ll;
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back
// inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }
ll INF = 1e15;
ll mod = 1e9 + 7;
// #define int ll
#define float double
int n;
ll m = 0;
vector<vector<int>> adj;
int pat = 0;
int br, he;
int dfs(int node, int par, int r)
{
int ret = 0;
if (node == r) ret = 1;
rep(i,0,adj[node].size()) {
if (adj[node][i] != par) {
if (dfs(adj[node][i], node, r)) ret = adj[node][i];
}
}
return ret;
}
int start(int N, bool A[MAX_N][MAX_N])
{
n = N;
adj.assign(n, {});
rep(i,0,n) {
rep(j,i + 1,n) {
if (A[i][j]) {
adj[i].pb(j);
adj[j].pb(i);
m++;
}
}
}
if (m = n - 1) {
rep(i,1,n) {
if (adj[i].size() == 2) {
br = i + 1;
break;
}
he = n / br;
}
}
return 0;
}
int nextMove(int R)
{
if (pat == R) exit(0); // assert ?
if (m = n - 1) return pat = dfs(pat, -1, R);
else
{
int rx = R % br, ry = R / br;
int px = pat % br, py = pat / br;
if (rx == px) {
if (R < pat) {
return pat = pat - 1;
}
else {
return pat = pat + 1;
}
}
else if (ry == py) {
if (R < pat) {
return pat = pat - br;
}
else {
return pat = pat + br;
}
}
// q 1 2 3 4
else if (ry < py && rx < px)
{
if (rx < px - 1) return pat = pat - 1;
else if (ry < (py - br)) return pat = pat - br;
else return pat;
}
else if (ry > py && rx > px)
{
if (rx > px + 1) return pat = pat + 1;
else if (ry > (py + br)) return pat = pat + br;
else return pat;
}
else if (ry > py && rx < px)
{
if (rx < px - 1) return pat = pat - 1;
else if (ry > (py + br)) return pat = pat + br;
else return pat;
}
else if (ry < py && rx > px)
{
if (rx > px + 1) return pat = pat + 1;
else if (ry < (py - br)) return pat = pat - br;
else return pat;
}
// wait
}
}
컴파일 시 표준 에러 (stderr) 메시지
coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:63:11: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
63 | if (m = n - 1) {
| ~~^~~~~~~
coprobber.cpp: In function 'int nextMove(int)':
coprobber.cpp:79:11: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
79 | if (m = n - 1) return pat = dfs(pat, -1, R);
| ~~^~~~~~~
coprobber.cpp:133:1: warning: control reaches end of non-void function [-Wreturn-type]
133 | }
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |