QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#623368#8790. First Billionrns_ksr#TL 261ms3928kbC++14869b2024-10-09 11:34:102024-10-09 11:34:14

Judging History

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

  • [2024-10-09 11:34:14]
  • 评测
  • 测评结果:TL
  • 用时:261ms
  • 内存:3928kb
  • [2024-10-09 11:34:10]
  • 提交

answer

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

const int N = 105;
int p[N], a[N];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	srand(time(0));
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) p[i] = i;
    vector<int> ans;
    int delta = 2e9;
    while(1) {
    	int sum1 = 0, sum2 = 0;
    	random_shuffle(p + 1, p + n + 1);
    	for (int i = 1; i <= n; i++) {
    		if (sum1 > sum2) {sum2 += a[p[i]];}
    		else {sum1 += a[p[i]];}
    	}
    	if(sum1 == sum2){
	    	sum1 = sum2 = 0;
	    	for (int i = 1; i <= n; i++) {
	    		if (sum1 > sum2) {ans.push_back(p[i]), sum2 += a[p[i]];}
	    		else {sum1 += a[p[i]];}
	    	}
	    	cout << ans.size();
    		for(auto k : ans) cout << " " << k;
    		return 0;
    			
    	}
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

10
386413329 88494216 245947398 316438989 192751270 204627269 65749456 3938400 150458676 345180997

output:

5 4 10 2 3 8

result:

ok OK (n = 10)

Test #2:

score: 0
Accepted
time: 1ms
memory: 3672kb

input:

10
119486233 299942886 169540407 349937991 597883752 32230162 140514533 57341098 12602102 220520836

output:

5 2 8 6 5 9

result:

ok OK (n = 10)

Test #3:

score: 0
Accepted
time: 1ms
memory: 3836kb

input:

14
384615281 84612238 83310504 54746763 142296081 56775470 128760350 343006424 177232390 214368720 67220468 21895072 16352717 224807522

output:

7 8 2 3 11 5 14 4

result:

ok OK (n = 14)

Test #4:

score: 0
Accepted
time: 1ms
memory: 3668kb

input:

14
270208635 14270307 89661499 113578022 47687195 101043954 38775146 208193324 650676076 351701957 3427619 59535626 24230888 27009752

output:

7 3 12 4 2 10 1 6

result:

ok OK (n = 14)

Test #5:

score: 0
Accepted
time: 87ms
memory: 3672kb

input:

20
61638928 106712373 5946815 178135484 4937573 111395400 15504655 67139983 101814514 312223647 130341028 43244171 37671364 54108486 337181317 37924824 153793862 70383750 102917244 66984582

output:

10 7 6 20 1 3 2 19 16 15 17

result:

ok OK (n = 20)

Test #6:

score: 0
Accepted
time: 7ms
memory: 3736kb

input:

20
67858098 61231428 99398662 1883806 82465954 303619377 87516412 154956240 94872199 76508350 13276828 136541811 203282099 99160366 127539385 13364660 141176136 39751629 67888657 127707903

output:

10 4 17 5 13 1 3 14 12 11 8

result:

ok OK (n = 20)

Test #7:

score: 0
Accepted
time: 261ms
memory: 3672kb

input:

24
17125795 281143405 10375259 196293002 158174864 34520650 52919232 87393970 99085271 62281508 67168428 55174991 54533464 51393059 89276370 41441658 72793517 30466999 73758332 97064918 111541434 142047546 12934221 101092107

output:

12 17 22 10 3 15 4 20 18 13 19 23 5

result:

ok OK (n = 24)

Test #8:

score: 0
Accepted
time: 20ms
memory: 3928kb

input:

24
70224368 148769600 36654748 23404220 15009825 57449487 46896672 6065662 10377031 133719710 23220853 184445684 8462667 88501546 155244839 229323557 140109402 52520271 78995771 75721556 87987586 118427778 107013825 101453342

output:

12 24 16 13 22 8 6 4 9 15 2 18 14

result:

ok OK (n = 24)

Test #9:

score: -100
Time Limit Exceeded

input:

28
122321206 60841271 22767116 183943582 6247754 32767541 19129802 21313874 144503909 59360441 12259051 19044256 50267333 25766572 133411289 32253746 102412217 46186594 55413161 39907615 52325783 86862071 185310732 138228874 22000146 149813853 98156445 77183766

output:


result: