結果
問題 | No.2845 Birthday Pattern in Two Different Calendars |
ユーザー | だれ |
提出日時 | 2024-08-23 23:05:23 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 110 ms / 2,000 ms |
コード長 | 6,292 bytes |
コンパイル時間 | 4,521 ms |
コンパイル使用メモリ | 234,752 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-08-23 23:05:29 |
合計ジャッジ時間 | 6,153 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 10 ms
6,816 KB |
testcase_02 | AC | 12 ms
6,816 KB |
testcase_03 | AC | 5 ms
6,940 KB |
testcase_04 | AC | 11 ms
6,944 KB |
testcase_05 | AC | 8 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,944 KB |
testcase_07 | AC | 7 ms
6,944 KB |
testcase_08 | AC | 4 ms
6,944 KB |
testcase_09 | AC | 5 ms
6,948 KB |
testcase_10 | AC | 4 ms
6,944 KB |
testcase_11 | AC | 5 ms
6,940 KB |
testcase_12 | AC | 11 ms
6,944 KB |
testcase_13 | AC | 3 ms
6,940 KB |
testcase_14 | AC | 3 ms
6,944 KB |
testcase_15 | AC | 6 ms
6,944 KB |
testcase_16 | AC | 3 ms
6,944 KB |
testcase_17 | AC | 6 ms
6,944 KB |
testcase_18 | AC | 6 ms
6,940 KB |
testcase_19 | AC | 11 ms
6,940 KB |
testcase_20 | AC | 4 ms
6,940 KB |
testcase_21 | AC | 13 ms
6,944 KB |
testcase_22 | AC | 110 ms
6,940 KB |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <complex> #include <cstdio> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <unordered_set> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define UNIQUE(x) \ std::sort((x).begin(), (x).end()); \ (x).erase(std::unique((x).begin(), (x).end()), (x).end()) using i64 = long long; using u64 = unsigned long long; using u32 = unsigned int; using i32 = int; using ld = long double; using f64 = double; template <class T, class U> bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template <class T, class U> bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template <class T = std::string, class U = std::string> inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") { if (f) std::cout << yes << "\n"; else std::cout << no << "\n"; } namespace io { template <class T, class U> istream& operator>>(istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <class T, class U> ostream& operator<<(ostream& o, pair<T, U>& p) { o << p.first << " " << p.second; return o; } template <typename T> istream& operator>>(istream& i, vector<T>& v) { rep(j, v.size()) i >> v[j]; return i; } template <typename T> string join(vector<T>& v) { stringstream s; rep(i, v.size()) s << ' ' << v[i]; return s.str().substr(1); } template <typename T> ostream& operator<<(ostream& o, vector<T>& v) { if (v.size()) o << join(v); return o; } template <typename T> string join(vector<vector<T>>& vv) { string s = "\n"; rep(i, vv.size()) s += join(vv[i]) + "\n"; return s; } template <typename T> ostream& operator<<(ostream& o, vector<vector<T>>& vv) { if (vv.size()) o << join(vv); return o; } void OUT() { std::cout << "\n"; } template <class Head, class... Tail> void OUT(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUT(std::forward<Tail>(tail)...); } void OUTL() { std::cout << std::endl; } template <class Head, class... Tail> void OUTL(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUTL(std::forward<Tail>(tail)...); } void IN() {} template <class Head, class... Tail> void IN(Head&& head, Tail&&... tail) { cin >> head; IN(std::forward<Tail>(tail)...); } } // namespace io using namespace io; namespace useful { long long modpow(long long a, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res *= a, res %= mod; a *= a; a %= mod; b >>= 1; } return res; } bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; } template <class T> void rearrange(vector<T>& a, vector<int>& p) { vector<T> b = a; for (int i = 0; i < int(a.size()); i++) { a[i] = b[p[i]]; } return; } template <class T> vector<pair<T, int>> rle_sequence(vector<T>& a) { vector<pair<T, int>> res; int n = a.size(); int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector<pair<char, int>> rle_string(string a) { vector<pair<char, int>> res; int n = a.size(); if (n == 1) return vector<pair<char, int>>{{a[0], 1}}; int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector<int> linear_sieve(int n) { vector<int> primes; vector<int> res(n + 1); iota(all(res), 0); for (int i = 2; i <= n; i++) { if (res[i] == i) primes.emplace_back(i); for (auto j : primes) { if (j * i > n) break; res[j * i] = j; } } return res; // return primes; } template <class T> vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) { int n = graph.size(); vector<long long> res(n, 2e18); res[start] = 0; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> que; que.push({0, start}); while (!que.empty()) { auto [c, v] = que.top(); que.pop(); if (res[v] < c) continue; for (auto [nxt, cost] : graph[v]) { auto x = c + cost; if (x < res[nxt]) { res[nxt] = x; que.push({x, nxt}); } } } return res; } } // namespace useful using namespace useful; template <class T, T l, T r> struct RandomIntGenerator { std::random_device seed; std::mt19937_64 engine; std::uniform_int_distribution<T> uid; RandomIntGenerator() { engine = std::mt19937_64(seed()); uid = std::uniform_int_distribution<T>(l, r); } T gen() { return uid(engine); } }; void solve() { int k, m, n; IN(k, m, n); if (m == 1) { OUT("No"); return; } vector<int> ans; vector<int> f(k); m--; rep(i, k) { if (f[i]) continue; int now = i; while (!f[now] && !f[(now + m) % k] && ans.size() < n) { f[now] = f[(now + m) % k] = 1; ans.emplace_back(now + 1); now = (now + m + m) % k; } } if (ans.size() < n) { OUT("No"); } else { OUT("Yes"); OUT(ans); } } int main() { std::cout << fixed << setprecision(15); cin.tie(nullptr); ios::sync_with_stdio(false); int t; IN(t); while (t--) solve(); }