結果
問題 | No.2845 Birthday Pattern in Two Different Calendars |
ユーザー | igeee |
提出日時 | 2024-08-23 23:18:54 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,072 bytes |
コンパイル時間 | 4,810 ms |
コンパイル使用メモリ | 270,484 KB |
実行使用メモリ | 13,420 KB |
最終ジャッジ日時 | 2024-08-23 23:19:05 |
合計ジャッジ時間 | 10,230 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | WA | - |
testcase_02 | AC | 137 ms
13,420 KB |
testcase_03 | AC | 123 ms
13,416 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 74 ms
10,472 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 98 ms
11,368 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 21 ms
6,940 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 209 ms
13,412 KB |
testcase_22 | AC | 601 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> #include <atcoder/all> using namespace std; using namespace atcoder; #define rep(i, n) for (long long i = 0; i < (long long)(n); i++) #define rrep(i,start,end) for (long long i = start;i >= (long long)(end);i--) #define repn(i,end) for(long long i = 0; i <= (long long)(end); i++) #define reps(i,start,end) for(long long i = start; i < (long long)(end); i++) #define repsn(i,start,end) for(long long i = start; i <= (long long)(end); i++) #define each(p,a) for(auto &p:a) typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef vector<long long> vll; typedef vector<pair<long long ,long long>> vpll; typedef vector<vector<long long>> vvll; typedef set<ll> sll; typedef map<long long , long long> mpll; typedef pair<long long ,long long> pll; typedef tuple<long long , long long , long long> tpl3; #define LL(...) ll __VA_ARGS__; input(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; input(__VA_ARGS__) #define Str(...) string __VA_ARGS__; input(__VA_ARGS__) #define Ch(...) char __VA_ARGS__; input(__VA_ARGS__) #define all(a) (a).begin(),(a).end() #define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() ); #define sz(x) (int)x.size() // << std::fixed << std::setprecision(10) const ll INF = 1LL << 60; const ld EPS = 1e-9; inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;} inline ll positive_mod(ll a,ll m){return (a % m + m)%m;} inline ll popcnt(ull a){ return __builtin_popcountll(a);} template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;} template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;} template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;} template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;} template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;} template<class... T>void input(T&... a){(cin >> ... >> a);} void print(){cout << endl;} template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;} template<class T> void pspace(const T& a){ cout << a << ' ';} void perr(){cerr << endl;} template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;} void yes(bool i = true){ return print(i?"yes":"no"); } void Yes(bool i = true){ return print(i?"Yes":"No"); } void YES(bool i = true){ return print(i?"YES":"NO"); } template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;} template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;} template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;} template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;} //grid探索用 vector<ll> _ta = {0,0,1,-1,1,1,-1,-1}; vector<ll> _yo = {1,-1,0,0,1,-1,1,-1}; bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);} ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;} ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} const ll MOD9 = 998244353LL; const ll MOD10 = 1000000007LL; void solve(){ LL(k,m,n); if(m == 1){ cout << "No" << endl; return ; } //貪欲 set<ll> used; vll ans ; repsn(i,1,k){ ll v = (i+m-2) % k + 1; if(!used.count(i) && !used.count(v)){ used.insert(i); used.insert(v); ans.push_back(i); } } if(ans.size() >= n){ cout << "Yes" << endl; rep(i,n){ pspace(ans[i]); } cout << endl; }else{ cout << "No" << endl; } } int main(){ ios::sync_with_stdio(false);cin.tie(nullptr); LL(t); while(t--){ solve(); } }