#1170848 (C++23) No.3585 Make Ends Meet (Easy)

• 問題: No.3585 Make Ends Meet (Easy)
• ユーザー: TKTYI
• 提出日時: 2026-07-10 21:45:21
• 言語: C++23 (gcc 15.2.0 + boost 1.90.0)
• 結果: WA
• 実行時間: -
• コード長: 3,004 bytes
• コンパイル時間: 4,228 ms
• コンパイル使用メモリ: 386,576 KB
• 実行使用メモリ: 11,904 KB
• 最終ジャッジ日時: 2026-07-10 21:45:32
• 合計ジャッジ時間: 6,726 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
sample	AC * 2
other	AC * 41 WA * 7

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M,K;cin>>N>>M>>K;
  M=N*(N-1)/2-M;
  if(M<K){cout<<"No"<<endl;return 0;}
  vvvl DP(K+1,vvl(N+1,vl(N+1,-1e18)));
  DP[0][1][1]=0;
  rep(i,0,K)rep(j,1,N+1)rep(k,1,j+1)if(DP[i][j][k]>=0)rep(l,1,N+1-j){
  	chmax(DP[i+1][j+l][l],DP[i][j][k]+1ll*k*l+1ll*l*(l-1)/2);
  }
  ll ma=*max_element(all(DP[K][N]));
  if(ma<M){cout<<"No"<<endl;return 0;}
  ll k=max_element(all(DP[K][N]))-DP[K][N].begin();
  ll i=K,j=N;
  vl A;
  while(1){
  	A.emplace_back(k);
  	if(!i)break;
  	rep(l,1,j-k+1)if(DP[i][j][k]==DP[i-1][j-k][l]+1ll*k*l+1ll*k*(k-1)/2){
  		i--;
  		j-=k;
  		k=l;
  		break;
  	}
  }
  vvb OK(N,vb(N));
  vl B=A;
  rep(i,1,sz(A))B[i]+=B[i-1];
  B.insert(B.begin(),0);
  rep(i,0,K){
  	M--;
  	OK[B[i]][B[i+2]-1]=1;
  }
  rep(i,0,K)rep(j,B[i],B[i+1])rep(k,B[i+1],B[i+2])if((j>B[i]||k<B[i+2]-1)&&M){
  	M--;
  	OK[j][k]=1;
  }
  rep(i,0,K+1)rep(j,B[i],B[i+1])rep(k,j+1,B[i+1])if(M){
  	M--;
  	OK[j][k]=1;
  }
  cout<<"Yes"<<endl;
  rep(i,0,N)rep(j,i+1,N)if(!OK[i][j])cout<<i+1<<" "<<j+1<<endl;
  return 0;
}