結果
問題 | No.1571 All Your Cycles Are Same Lengths |
ユーザー |
![]() |
提出日時 | 2021-04-13 15:24:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,974 bytes |
コンパイル時間 | 4,150 ms |
コンパイル使用メモリ | 251,280 KB |
最終ジャッジ日時 | 2025-01-20 16:43:13 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 1 |
other | WA * 10 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = long long;#define all(s) (s).begin(),(s).end()#define rep2(i, m, n) for (int i = (m); i < (n); ++i)#define rep(i, n) rep2(i, 0, n)#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define P pair<ll,ll>#define REP(i, n) for (int i = 0; i < (n); ++i)const ll mod = 998244353;//const ll mod = 1000000007;const ll inf = 2000000000000000000ll;static const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }void gbjsmzmfuuvdf(){ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(20);}int main() {gbjsmzmfuuvdf();ll n,t;cin>>n>>t;if(n==3){cout<<"Yes"<<endl;cout<<1<<" "<<2<<" "<<t<<endl;cout<<1<<" "<<3<<" "<<0<<endl;cout<<2<<" "<<3<<" "<<0<<endl;return 0;}if(n%2==0&&t%2==1){cout<<"No"<<endl;return 0;}if(n%2==0&&t%2==0){cout<<"Yes"<<endl;for(int i=2;i<=n;i++){cout<<1<<" "<<i<<" "<<t/2<<endl;}for(int i=2;i<=n;i++){for(int j=i+1;j<=n;j++){cout<<i<<" "<<j<<" "<<0<<endl;}}return 0;}if(n%2==1&&t%2==0){cout<<"Yes"<<endl;for(int i=2;i<=n;i++){cout<<1<<" "<<i<<" "<<t/2<<endl;}for(int i=2;i<=n;i++){for(int j=i+1;j<=n;j++){cout<<i<<" "<<j<<" "<<0<<endl;}}return 0;}if(n%2==1&&t%2==1&&1<=t&&t<n-2){cout<<"No"<<endl;return 0;}if(n%2==1&&t%2==1){ll u=(t-n)/2;cout<<"Yes"<<endl;for(int i=2;i<=n;i++){cout<<1<<" "<<i<<" "<<1+u<<endl;}for(int i=2;i<=n;i++){for(int j=i+1;j<=n;j++){cout<<i<<" "<<j<<" "<<1<<endl;}}return 0;}assert(false);}