結果
問題 | No.2845 Birthday Pattern in Two Different Calendars |
ユーザー | 遭難者 |
提出日時 | 2024-06-10 00:32:35 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 87 ms / 2,000 ms |
コード長 | 3,064 bytes |
コンパイル時間 | 5,033 ms |
コンパイル使用メモリ | 313,380 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-10 09:01:00 |
合計ジャッジ時間 | 6,895 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 14 ms
6,812 KB |
testcase_02 | AC | 15 ms
6,944 KB |
testcase_03 | AC | 7 ms
6,944 KB |
testcase_04 | AC | 13 ms
6,940 KB |
testcase_05 | AC | 10 ms
6,940 KB |
testcase_06 | AC | 7 ms
6,944 KB |
testcase_07 | AC | 8 ms
6,944 KB |
testcase_08 | AC | 4 ms
6,944 KB |
testcase_09 | AC | 7 ms
6,940 KB |
testcase_10 | AC | 7 ms
6,940 KB |
testcase_11 | AC | 7 ms
6,940 KB |
testcase_12 | AC | 14 ms
6,940 KB |
testcase_13 | AC | 4 ms
6,940 KB |
testcase_14 | AC | 4 ms
6,940 KB |
testcase_15 | AC | 8 ms
6,940 KB |
testcase_16 | AC | 4 ms
6,944 KB |
testcase_17 | AC | 7 ms
6,944 KB |
testcase_18 | AC | 8 ms
6,944 KB |
testcase_19 | AC | 13 ms
6,940 KB |
testcase_20 | AC | 6 ms
6,944 KB |
testcase_21 | AC | 21 ms
6,944 KB |
testcase_22 | AC | 87 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using mint = atcoder::modint1000000007; istream& operator>>(istream& is, mint& a) { int t; is >> t; a = t; return is; } ostream& operator<<(ostream& os, mint a) { return os << a.val(); } #endif #ifdef DEBUG #define _GLIBCXX_DEBUG #else #pragma GCC target("avx2") #pragma GCC optimize("Ofast,unroll-loops") #define cerr if (false) cerr #undef assert #define assert(...) void(0) #undef endl #define endl '\n' #endif #undef long #define long long long #define overload3(a, b, c, name, ...) name #define rep1(n) for (long i = 0; i < n; i++) #define rep2(i, n) for (long i = 0; i < n; i++) #define rep3(i, a, b) for (long i = a; i < b; i++) #define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define per1(n) for (long i = n - 1; i >= 0; i--) #define per2(i, n) for (long i = n - 1; i >= 0; i--) #define per3(i, a, b) for (long i = b - 1; i >= (a); i--) #define per(...) overload3(__VA_ARGS__, per3, per2, per1)(__VA_ARGS__) #define ALL(a) a.begin(), a.end() #define UNIQUE(a) sort(ALL(a)); a.erase(unique(ALL(a)), a.end()) #define vec vector template<typename T> ostream& operator<<(ostream& os, vector<T> a) { const int n = a.size(); rep(i, n) { os << a[i]; if (i + 1 != n) os << " "; } return os; } template<typename T, size_t n> ostream& operator<<(ostream& os, array<T, n> a) { rep(i, n) { os << a[i]; if (i + 1 != n) os << " "; } return os; } template<typename T> istream& operator>>(istream& is, vector<T>& a) { for (T& i : a) is >> i; return is; } template<typename T, typename S> bool chmin(T& x, S y) { if (x > (T)y) { x = (T)y; return true; } return false; } template<typename T, typename S> bool chmax(T& x, S y) { if (x < (T)y) { x = (T)y; return true; } return false; } template<typename T> void operator++(vector<T>& a) { for (T& i : a) ++i; } template<typename T> void operator--(vector<T>& a) { for (T& i : a) --i; } template<typename T> void operator++(vector<T>& a, int) { for (T& i : a) i++; } template<typename T> void operator--(vector<T>& a, int) { for (T& i : a) i--; } void solve() { int k, m, n; cin >> k >> m >> n; m--; vec<bool> c(k); vec<int> ans; rep(st, k) { if (c[st]) continue; vec<int> loop; int now = st; do { loop.push_back(now); c[now] = true; now = (now + m) % k; } while (now != st); const int sz = loop.size(); for (int i = 1; i < sz; i += 2) ans.push_back(loop[i] + 1); } cerr << ans.size() << endl; if (ans.size() < n) { cout << "No" << endl; return; } ans.resize(n); cout << "Yes" << endl; cout << ans << endl; return; } int main() { srand((unsigned)time(NULL)); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(40); int t = 1; cin >> t; rep(t) solve(); return 0; }