oj.uz

Submission #1112948

# Submission time Handle Problem Language Result Execution time Memory
1112948 2024-11-15T09:57:44 Z elotelo966 Arranging Shoes (IOI19_shoes) C++17
10 / 100
 1000 ms 3160 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define OYY LLONG_MAX
#define mod 1000000007
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FOR for(int i=1;i<=n;i++)
#define mid (start+end)/2
#define lim 300005
#define fi first
#define se second

int n,cev;
 
long long count_swaps(std::vector<int> s) {
	n=s.size();
	bool subtask=1;
	for(int i=0;i<n/2;i++){
		if(s[i]>0)subtask=0;
	}
	if(subtask){
		int tut=n/2;
		tut--;
		return tut*(tut+1)/2;
	}
	for(int i=0;i<n;i+=2){
		if(s[i]<0){
			int bul=-1;
			for(int j=i+1;j<n;j++){
				if(s[j]==-s[i]){
					bul=j;
					break;
				}
			}
			for(int j=bul;j>i+1;j--){
				swap(s[j],s[j-1]);
				cev++;
			}
		}
		else{
			int bul=-1;
			for(int j=i+1;j<n;j++){
				if(s[j]==-s[i]){
					bul=j;
					break;
				}
			}
			for(int j=bul;j>i;j--){
				swap(s[j],s[j-1]);
				cev++;
			}
		}
	}
	return cev;
}

/*
int main(){
	//faster
	int m;cin>>m;
	
	vector<int> vv;
	
	for(int i=1;i<=m;i++){
		int x;cin>>x;
		vv.push_back(x);
	}
		
	cout<<count_swaps(vv)<<'\n';
	
	return 0;
}
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 4 ms 592 KB Output is correct
21 Correct 4 ms 592 KB Output is correct
22 Correct 29 ms 3152 KB Output is correct
23 Correct 15 ms 3152 KB Output is correct
24 Correct 18 ms 3160 KB Output is correct
25 Execution timed out 1071 ms 2896 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 15.0

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