Submission #955669

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955669	2024-03-31T09:56:04 Z	IUA_Hasin	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	19 ms	3416 KB

shoes

#include <bits/stdc++.h>
 
#define endl                                "\n"
#define finp                                for(int i=0; i<n; i++)
#define fknp                                for(int k=0; k<n; k++)
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define inpintn                             int n; cin>>n
#define inpintarrn                          int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn                           long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll                                  long long
 
using namespace std; 

#include "shoes.h"

long long count_swaps(std::vector<int> s) {
	ll n = s.size();
	ll ind = 0;
	ll ans = 0;
	for(int i=0; i<n; i++){
		if(s[i]<0){
			ll dist = abs(i-ind);
			ans = ans+dist;
			ind = ind+2;
		}
	}
	return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct

Subtask #2

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	440 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	432 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	1 ms	444 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	17 ms	3008 KB	Output is correct
23	Correct	16 ms	3264 KB	Output is correct
24	Correct	17 ms	3416 KB	Output is correct
25	Correct	15 ms	2868 KB	Output is correct
26	Correct	17 ms	3160 KB	Output is correct
27	Correct	15 ms	2908 KB	Output is correct
28	Correct	15 ms	3156 KB	Output is correct
29	Correct	15 ms	3164 KB	Output is correct
30	Correct	15 ms	3260 KB	Output is correct
31	Correct	17 ms	3160 KB	Output is correct
32	Correct	15 ms	3260 KB	Output is correct
33	Correct	14 ms	2908 KB	Output is correct
34	Correct	19 ms	3244 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	15 ms	3164 KB	Output is correct
38	Correct	15 ms	3164 KB	Output is correct
39	Correct	15 ms	3164 KB	Output is correct

Subtask #4

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	15 ms	3004 KB	Output is correct
6	Correct	14 ms	3268 KB	Output is correct
7	Correct	17 ms	3156 KB	Output is correct
8	Correct	15 ms	3160 KB	Output is correct
9	Correct	17 ms	3164 KB	Output is correct
10	Correct	15 ms	3164 KB	Output is correct

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-

Subtask #6

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Incorrect	0 ms	348 KB	Output isn't correct
4	Halted	0 ms	0 KB	-