QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#72221	#3836. So I'll Max Out My Constructive Algorithm Skills	neko_nyaa^#	WA	2ms	3452kb	C++23	784b	2023-01-15 10:09:43	2023-01-15 10:09:44

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-01-15 10:09:44]
评测

测评结果：WA
用时：2ms
内存：3452kb

查看

[2023-01-15 10:09:43]
提交

answer

#include <bits/stdc++.h>
using namespace std;

#define int long long

void solve() {
	int n; cin >> n;
	int a[n][n];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> a[i][j];
		}
	}

	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (i % 2) {
			reverse(a[i], a[i]+n);
		}
		for (int j = 0; j < n; j++) {
			ans.push_back(a[i][j]);
		}
	}

	int sc = 0;
	for (int i = 1; i < n; i++) {
		if (a[i] > a[i-1]) sc++;
		else sc--;
	}

	if (sc < 0) {
		reverse(ans.begin(), ans.end());
	}

	for (int i = 0; i < n*n; i++) {
		cout << ans[i];
		if (i == n*n-1) cout << '\n';
		else cout << ' ';
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);

	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}

源文件, 语言: C++23

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 3452kb

input:

output:

4 3 1 2

result:

ok correct

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3444kb

input:

100
9
30 75 35 51 25 19 76 65 62
11 56 63 60 77 48 28 26 74
16 44 46 41 17 8 66 61 42
29 7 43 38 40 31 27 10 39
52 23 58 80 50 20 33 69 47
79 1 5 49 22 37 71 18 70
54 72 4 64 55 34 12 6 15
14 53 45 13 32 59 73 57 81
36 3 78 24 2 68 9 67 21
7
11 28 2 19 9 41 24
17 34 5 10 42 18 47
33 35 22 8 49 1 29
...

output:

30 75 35 51 25 19 76 65 62 74 26 28 48 77 60 63 56 11 16 44 46 41 17 8 66 61 42 39 10 27 31 40 38 43 7 29 52 23 58 80 50 20 33 69 47 70 18 71 37 22 49 5 1 79 54 72 4 64 55 34 12 6 15 81 57 73 59 32 13 45 53 14 36 3 78 24 2 68 9 67 21
11 28 2 19 9 41 24 47 18 42 10 5 34 17 33 35 22 8 49 1 29 26 7 44 ...

result:

wrong answer [case 4] Not lazy, up = 42, down = 38