結果

問題 No.942 プレゼント配り
ユーザー ningenMeningenMe
提出日時 2019-12-05 02:38:01
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,657 bytes
コンパイル時間 2,189 ms
コンパイル使用メモリ 180,336 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2024-12-15 06:06:16
合計ジャッジ時間 3,666 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 22 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 WA -
testcase_04 AC 20 ms
6,816 KB
testcase_05 AC 21 ms
6,816 KB
testcase_06 AC 2 ms
6,820 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 17 ms
6,820 KB
testcase_09 AC 18 ms
6,816 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 17 ms
6,820 KB
testcase_15 AC 13 ms
6,820 KB
testcase_16 AC 18 ms
6,820 KB
testcase_17 AC 15 ms
6,816 KB
testcase_18 AC 1 ms
6,820 KB
testcase_19 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
	int N,K,M; cin >> N >> K;
	corner(N==1&&K==1,"Yes\n1");
	M = N/K;
	corner(M==1,"No");
	vector<vector<int>> ans(K);
	int cnt = 1;
	if(M%2==0){
		while(cnt <= N){
			for(int i = 0; i < K; ++i) ans[i].push_back(cnt++);
			for(int i=K-1; 0 <=i; --i) ans[i].push_back(cnt++);
		}
	}
	else{
		for(int i = 0; i < K; ++i) ans[i].push_back(3*K-i);
		for(int i = 0; i < K; i +=2) ans[i].push_back(cnt++);
		for(int i = 1; i < K; i +=2) ans[i].push_back(cnt++);
		vector<pair<int,int>> ord(K);
		for(int i = 0; i < K; ++i) ord[i] = {ans[i][0]+ans[i][1],i};
		sort(ALL(ord),greater<>());
		for(auto p:ord){
			int i = p.second;
			ans[i].push_back(cnt++);
		}
		cnt = 3*K+1;
		while(cnt <= N){
			for(int i = 0; i < K; ++i) ans[i].push_back(cnt++);
			for(int i=K-1; 0 <=i; --i) ans[i].push_back(cnt++);
		}
	}
	cout << "Yes" << endl;
	for(int i = 0; i < K; ++i) {
		for(int e:ans[i]) cout << e << " ";
		cout << endl;
	}

}
0