#722542 (C++17) No.1777 万華鏡美術館

提出ソース

結果

問題	No.1777 万華鏡美術館
ユーザー	heno239
提出日時	2021-12-07 00:05:36
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,547 bytes
コンパイル時間	1,931 ms
コンパイル使用メモリ	169,016 KB
実行使用メモリ	12,048 KB
最終ジャッジ日時	2024-07-07 09:51:05
合計ジャッジ時間	2,496 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 11,520 KB
testcase_01	AC	6 ms 11,520 KB
testcase_02	WA	-
testcase_03	AC	6 ms 11,520 KB
testcase_04	AC	6 ms 11,520 KB
testcase_05	AC	6 ms 11,520 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	AC	7 ms 11,776 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

bool exi[500][500];
void solve() {
	int n, m; cin >> n >> m;
	if (m == 0) {
		if (n % 2 == 0) {
			cout << 4 << "\n";
		}
		else {
			cout << 5 << "\n";
		}
		return;
	}
	int ans = 1;
	vector<int> a(m), b(m);
	rep(i, m) {
		cin >> a[i] >> b[i]; a[i]--; b[i]--;
		exi[a[i]][b[i]] = true;
	}
	rep(i, n - 1)exi[i][i + 1] = true;
	exi[0][n - 1] = true;
	int ad = 2;
	rep(i, n)Rep(j, i + 1, n)Rep(k, j + 1, n) {
		//if (exi[i][j] && exi[j][k] && exi[i][k])ad = 3;
	}
	vector<vector<int>> ch(m+1);
	rep(i, m) {
		P cur = { 0,n - 1 };
		int par = m;
		rep(j, m) {
			if (i == j)continue;
			if (a[j] <= a[i] && b[i] <= b[j]) {
				if (cur.first <= a[j] && b[j] <= cur.second) {
					cur = { a[j],b[j] };
					par = j;
				}
			}
		}
		ch[par].push_back(i);
	}
	bool e[2] = {};
	a.push_back(0);
	b.push_back(n - 1);
	function<void(int,int)> dfs = [&](int id,int dep) {
		vector<P> ps;
		for (int to : ch[id]) {
			ps.push_back({ a[to],b[to] });
		}
		sort(all(ps));
		bool ist = false;
		if (id == m)ist = true;
		int le = a[id];
		for (P p : ps) {
			if (le != p.first)ist = true;
			le = p.second;
		}
		if (le != b[id])ist = true;
		if (ist)e[dep] = true;
		for (int to : ch[id])dfs(to, dep^1);
	};
	dfs(m, 0);
	if (e[0] && e[1]) {
		cout << "?\n";
		cout << 5 << "\n";
	}
	else {
		vector<int> col(n);
		vector<bool> used(n);
		vector<vector<int>> G(n);
		rep(i, n) {
			int ni = (i + 1 == n) ? 0 : i + 1;
			G[i].push_back(ni);
			G[ni].push_back(i);
		}
		rep(i, m) {
			G[a[i]].push_back(b[i]);
			G[b[i]].push_back(a[i]);
		}
		queue<int> q;
		q.push(0); used[0] = true;
		col[0] = 0;
		while (!q.empty()) {
			int id = q.front(); q.pop();
			for (int to : G[id]) {
				if (used[to]) {
					if (col[to] == col[id]) {
						cout << 5 << "\n"; return;
					}
				}
				else {
					used[to] = true;
					col[to] = col[id] ^ 1;
					q.push(to);
				}
			}
		}
		cout << 4 << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(8);
	//init_f();
	//init();
	//while(true)
	//expr();
	//init();
	//int t; cin >> t; rep(i,t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード