QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#542738	#8936. Team Arrangement	ucup-team1766^#	TL	6ms	5256kb	C++23	714b	2024-09-01 04:50:28	2024-09-01 04:50:29

Judging History

This is the latest submission verdict.

[2024-09-01 04:50:29]
Judged

Verdict: TL
Time: 6ms
Memory: 5256kb

Show

[2024-09-01 04:50:28]
Submitted

answer

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

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n; cin >> n;
	
	set<vector<int>> s {vector<int>(n)};
	for (int _ = 0; _ < n; _++) {
		set<vector<int>> t;
		int l, r; cin >> l >> r; l--, r--;
		
		while (l <= r) {
			for (auto x : s) {
				vector<int> y = x;
				y[l]++;
				t.emplace(std::move(y));
			}
			l++;
		}
		s = std::move(t);
	}

	vector<int> w(n); for (auto &x : w) cin >> x;
	long long mx = LLONG_MIN;
	for (auto x : s) {
		long long sum = 0;
		bool ok = 1;
		for (int i = 0; i < n; i++) sum += 1LL * x[i]/(i+1) * w[i], ok &= x[i] % (i+1) == 0;
		if (ok) mx = max(mx, sum);
	}
	if (mx == LLONG_MIN) cout << "impossible\n";
	else cout << mx << '\n';
}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3812kb

input:

output:

result:

ok single line: '9'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

output:

result:

ok single line: '100'

Test #3:

score: 0

Accepted

time: 0ms

memory: 3816kb

input:

output:

impossible

result:

ok single line: 'impossible'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3596kb

input:

3
2 3
1 2
2 2
-100 -200 100000

output:

-300

result:

ok single line: '-300'

Test #5:

score: 0

Accepted

time: 1ms

memory: 3580kb

input:

9
1 4
2 5
3 4
1 5
1 1
2 5
3 5
1 3
1 1
1 1 1 1 1 1 1 1 1

output:

result:

ok single line: '6'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

14
3 3
1 2
2 3
2 3
2 3
1 1
2 3
1 3
3 3
1 3
1 3
1 2
2 3
1 3
-9807452 -9610069 4156341 2862447 6969109 -7245265 -2653530 -5655094 6467527 -6872459 3971784 7312155 9766298 -2719573

output:

-16558567

result:

ok single line: '-16558567'

Test #7:

score: 0

Accepted

time: 2ms

memory: 3772kb

input:

14
1 2
1 4
2 3
3 5
4 5
2 5
2 4
2 4
1 2
3 4
1 5
2 4
1 1
4 5
-13763 -7354207 1096407 -9063321 -4824546 -6275546 1258145 -5272834 -8631107 3581157 2320771 -7714508 8446625 -6816167

output:

-2673021

result:

ok single line: '-2673021'

Test #8:

score: 0

Accepted

time: 5ms

memory: 4268kb

input:

14
2 3
4 4
1 7
3 6
3 4
1 1
1 4
4 7
3 7
1 7
2 3
6 6
1 1
3 6
2923142 1686477 640352 2848353 9202543 -4441381 4866381 -3610520 8124124 -1372894 1111310 -7538627 466143 9937961

output:

result:

ok single line: '5939733'

Test #9:

score: 0

Accepted

time: 6ms

memory: 5256kb

input:

14
1 7
1 2
8 8
1 1
7 8
6 9
7 8
1 4
6 9
3 3
1 1
3 7
5 8
4 8
-7139089 6365816 -9893288 5936146 -2803918 -4961415 1495365 -2564851 -2630365 -8608883 5813455 -4005459 -8844054 6703783

output:

impossible

result:

ok single line: 'impossible'

Test #10:

score: -100

Time Limit Exceeded

input:

14
6 13
3 7
2 13
6 8
4 5
12 13
3 10
4 11
2 14
3 4
5 13
10 14
10 14
3 12
-8599727 -1496394 855072 -7439122 -5170228 8009298 -250221 5841035 2949765 7166358 -3516548 -6851737 8173765 -917122