QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#627541#9422. Two-star Contestshiqiaqiaya#WA 12ms4212kbC++201.4kb2024-10-10 16:15:592024-10-10 16:16:00

Judging History

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

  • [2024-10-10 16:16:00]
  • 评测
  • 测评结果:WA
  • 用时:12ms
  • 内存:4212kb
  • [2024-10-10 16:15:59]
  • 提交

answer

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

void solve() {
	int n, m, k;
	cin >> n >> m >> k;

	vector<int> s(n + 2);
	vector<vector<int>> p(n + 1, vector<int> (m + 1));
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
		for (int j = 1; j <= m; j++) {
			cin >> p[i][j];
		}
	}

	vector<int> pos(n + 1);
	iota(pos.begin(), pos.end(), 0);
	sort(pos.begin() + 1, pos.end(), [&](auto x, auto y) {
		return s[x] > s[y];
	});

	int lst = 1e18;
	for (int i = 1; i <= n; i++) {
		int u = pos[i], t = 0;
		for (int j = 1; j <= m; j++) {
			if (p[u][j] != -1) t += p[u][j];
		}
		for (int j = 1; j <= m; j++) {
			if (p[u][j] == -1) {
				p[u][j] = min(k, s[u] == s[pos[i - 1]] ? lst - t : lst - t - 1);
				t += p[u][j];
			}
		}
		if (t >= lst) {
			// cout << i << " " << lst << " " << t << " " << pos[i] << "\n";
			cout << "No\n";
			return;
		}
		if (i + 1 <= n && s[u] != s[pos[i + 1]]) lst = t;
	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (p[i][j] < 0) {
				cout << "No\n";
				return;
			}
		}
	}

	cout << "Yes\n";
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++) {
			cout << p[i][j] << " \n"[j == m];
		}
	}
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T;
    cin >> T;
    while (T--) solve();

    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3552kb

input:

5
3 4 5
5 1 3 -1 -1
2 -1 5 -1 5
3 3 -1 -1 4
2 3 10
10000 5 0 -1
1 10 10 10
2 3 10
10 1 2 3
100 4 5 6
2 3 10
100 1 2 3
10 4 5 6
2 3 10000
100 -1 -1 -1
1 -1 -1 -1

output:

Yes
1 3 5 5
2 5 0 5
3 5 1 4
No
Yes
1 2 3
4 5 6
No
Yes
10000 10000 10000
10000 10000 9999

result:

ok ok 5 cases (5 test cases)

Test #2:

score: -100
Wrong Answer
time: 12ms
memory: 4212kb

input:

1013
3 2 1
1 -1 -1
2 0 1
3 -1 -1
4 8 96295
302790137 -1 849 -1 -1 33907 7926 9461 70117
695984050 -1 -1 56792 -1 -1 -1 19527 -1
302790137 12828 30553 40825 67577 91517 77952 55631 63781
302790137 29385 -1 -1 -1 750 -1 -1 -1
2 6 72716304
892657961 -1 -1 66436933 -1 45419040 55642613
892657961 -1 6271...

output:

Yes
0 0
0 1
1 1
Yes
96295 849 96295 96295 33907 7926 9461 70117
96295 96295 56792 96295 96295 96295 19527 96295
12828 30553 40825 67577 91517 77952 55631 63781
29385 96295 96295 96295 750 96295 96295 96295
Yes
72716304 72716304 66436933 72716304 45419040 55642613
72716304 62712753 72716304 21765515 ...

result:

wrong answer Participant fails to find an answer while the jury found one. (test case 5)