結果

問題 No.3012 岩井星人グラフ
ユーザー 👑 binap
提出日時 2024-12-05 01:28:09
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 35 ms / 2,000 ms
コード長 2,952 bytes
コンパイル時間 17,968 ms
コンパイル使用メモリ 317,280 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2025-01-25 21:55:19
合計ジャッジ時間 20,317 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

// another form(random)

random_device seed;
mt19937 mt(seed());

int main(){
	int x, y;
	cin >> x >> y;
	int sz = x * y;
	cout << sz << ' ' << sz << "\n";
	auto out = [&](int u, int v){
		cout << u + 1 << ' ' << v + 1 << "\n";
	};
	
	out(0, 1);
	out(1, 2);
	out(2, 0);
	
	vector<int> vec = {0, 1, 2};
	
	int nxt = 3;
	
	for(; nxt < x; nxt++){
		int sz = vec.size();
		uniform_int_distribution dist(0, sz - 1);
		
		int idx = dist(mt);
		int u = vec[idx];
		vec.erase(vec.begin() + idx);
		
		out(u, nxt);
		
		vec.push_back(nxt);
		vec.push_back(nxt);
	}
	
	
	
	for(int u : vec){
		int from = u;
		rep(i, y - 1){
			out(from, nxt);
			from = nxt;
			nxt++;
		}
	}
	
	return 0;
}
0