QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#246973#7619. Make SYSU Great Again Iucup-team2303#WA 0ms3876kbC++171.1kb2023-11-11 13:09:112023-11-11 13:09:12

Judging History

你现在查看的是最新测评结果

  • [2023-11-11 13:09:12]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3876kb
  • [2023-11-11 13:09:11]
  • 提交

answer

// #pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
// #define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) {rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1];}

int a, b;

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a >> b;
	rep(i, 1, a) {
		cout << i << ' ' << i << '\n';
		if(i != a) cout << i << ' ' << i + 1 << '\n';
	}
	cout << a << ' ' << a - 1 << '\n';
	b -= 2 * a;
	rep(i, 1, a) {
		if(!b) break;
		rep(j, 1, a) {
			if(!b) break;
			if(i == j || j == i + 1 || (i == a && j == a - 1)) continue;
			cout << i << ' ' << j << '\n';
			--b;
		}
	}
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3876kb

input:

3 6

output:

1 1
1 2
2 2
2 3
3 3
3 2

result:

wrong answer The answer is wrong: There are fewer than two numbers in one row or column