CSES - Leirikisa 9.12.2021

CSES - Leirikisa 9.12.2021 - Results

Submission details
Task:	Pörssihai
Sender:	andreibe
Submission time:	2021-12-10 18:54:15 +0200
Language:	C++ (C++11)
Status:	READY
Result:	29

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	17
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1	details
#2	ACCEPTED	0.01 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.04 s	2	details
#5	ACCEPTED	0.04 s	2	details
#6	ACCEPTED	0.04 s	2	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	TIME LIMIT EXCEEDED	--	3	details
#10	TIME LIMIT EXCEEDED	--	3	details
#11	TIME LIMIT EXCEEDED	--	3	details
#12	TIME LIMIT EXCEEDED	--	3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <string>
#include <math.h>
#include <map>
#include <algorithm>
#include <vector>
#include <fstream>
#include <set>
#include <unordered_map>
#include <queue>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define LOOP(i,a,l) for (int i = a; i < l; i++)
#define LUO_VERKKO LOOP(i,0,m) {int a,b; cin >> a >> b; v[a].push_back(b); v[b].push_back(a);}
#define COLLECT for (int i = 0; i < n; i++) cin >> s[i]
#define A 999999999999999999LL
//https://cses.fi/dt/
int n;
int s[101010];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> s[i];
		ll sum = 0;
		float best = 0;
		int pit = 0;
		for (int j = i; j >= 0; j--)
		{
			sum += s[j];
			float keskiarvo = sum / (float)(i - j + 1);
			if (keskiarvo >= best) {
				best = keskiarvo;
				pit = (i - j + 1);
			}
		}
		cout << pit << " ";
	}
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`200 5986 845897 759781 171305 7836...` view save

correct output
`1 1 2 3 4 1 1 2 4 1 2 1 2 5 6 ...` view save

user output
`1 1 2 3 4 1 1 2 4 1 2 1 2 5 6 ...` Truncated

Test 2

Group: 1

Verdict: ACCEPTED

input
`200 607815 909742 130099 813674 34...` view save

correct output
`1 1 3 1 5 1 1 3 4 5 1 1 1 4 10...` view save

user output
`1 1 3 1 5 1 1 3 4 5 1 1 1 4 10...` Truncated

Test 3

Group: 1

Verdict: ACCEPTED

input
`200 921591 381013 930275 151815 69...` view save

correct output
`1 2 1 4 5 1 2 3 4 1 2 7 1 2 3 ...` view save

user output
`1 2 1 4 5 1 2 3 4 1 2 7 1 2 3 ...` Truncated

Test 4

Group: 2

Verdict: ACCEPTED

input
`5000 952303 272950 268680 897180 13...` view save

correct output
`1 2 3 1 2 1 4 8 9 10 1 2 13 14...` view save

user output
`1 2 3 1 2 1 4 8 9 10 1 2 13 14...` Truncated

Test 5

Group: 2

Verdict: ACCEPTED

input
`5000 815856 460818 496023 308974 33...` view save

correct output
`1 2 3 4 5 1 1 2 9 1 11 12 13 1...` view save

user output
`1 2 3 4 5 1 1 2 9 1 11 12 13 1...` Truncated

Test 6

Group: 2

Verdict: ACCEPTED

input
`5000 4889 373080 366119 72135 10214...` view save

correct output
`1 1 2 3 4 1 1 2 3 4 5 1 2 3 1 ...` view save

user output
`1 1 2 3 4 1 1 2 3 4 5 1 2 3 1 ...` Truncated

Test 7

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 444890 370930 385763 316218 44...` view save

correct output
`1 2 3 4 1 2 3 4 9 1 2 1 4 5 6 ...` view save

user output
(empty)

Test 8

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 202077 270536 246808 189471 19...` view save

correct output
`1 1 2 3 4 1 1 3 4 5 1 2 8 9 10...` view save

user output
(empty)

Test 9

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 736301 784710 628727 708231 64...` view save

correct output
`1 1 3 4 5 6 7 1 2 1 4 1 1 7 1 ...` view save

user output
(empty)

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 242104 238293 242641 242281 24...` view save

correct output
`1 2 1 2 3 1 2 3 1 2 1 4 11 12 ...` view save

user output
(empty)

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 252952 189698 245317 275463 24...` view save

correct output
`1 2 1 1 2 4 7 1 2 3 1 2 3 1 1 ...` view save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 214451 357457 213436 351167 21...` view save

correct output
`1 1 2 1 4 5 6 7 8 9 1 1 3 4 5 ...` view save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 363703 361248 358992 356404 35...` view save

correct output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 718920 716974 715476 714540 71...` view save

correct output
`1 2 3 4 5 6 7 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 614078 647174 701983 580935 58...` view save

correct output
`1 1 1 3 4 1 6 8 9 1 1 3 4 14 1...` view save

user output
(empty)

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 788376 788632 788880 789118 78...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 711774 711541 711305 711627 71...` view save

correct output
`1 2 3 1 2 6 1 2 1 2 3 6 7 1 2 ...` view save

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 685798 944128 587123 653271 65...` view save

correct output
`1 1 2 3 4 1 2 7 8 10 11 1 1 3 ...` view save

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 734074 734109 733868 733873 73...` view save

correct output
`1 1 3 4 5 1 1 1 1 1 1 1 3 5 6 ...` view save

user output
(empty)

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1000000 143117 1 267468 262833 141471 ...` view save

correct output
`1 2 1 2 3 1 1 2 4 1 2 10 11 12...` view save

user output
(empty)

Leirikisa 9.12.2021

Pörssihai

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (andreibe)