oj.uz

답안 #282845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282845 2020-08-25T04:28:36 Z suren Arranging Shoes (IOI19_shoes) C++14
10 / 100
 1 ms 288 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define F first
#define S second
 
int count_swaps( vector < int > vc ){
	
	int ans = 0, i;
	
	int flag = true;
	
	for( i = 1; i < vc.size(); i ++ ){
		if( abs( vc[i] ) != abs( vc[i-1] ) ){
			flag = false;
			break;
		}
	}
	
	if( flag == true ){
		vector < int > srg;
		vector < int > eyrg;
		
		for( i = 0; i < vc.size(); i ++ ){
			if( vc[i] < 0 )
				srg.pb( i );
			if( vc[i] > 0 )
				eyrg.pb( i );
		}
		reverse( srg.begin(), srg.end() );
		reverse( eyrg.begin(), eyrg.end() );
		for( i = 0; i < vc.size()-1; i ++ ){
			if( vc[i] == 0 )
				continue;
			if( vc[ i ] < 0 ){
				ans += eyrg[ eyrg.size() - 1 ] - i - 1;
				vc[ eyrg[ eyrg.size() - 1 ] ] = 0;
				eyrg.pop_back();
				srg.pop_back();
			}
			else{
				ans += srg[ srg.size() - 1 ] - i;
				vc[ srg[ srg.size() - 1 ] ] = 0;
				eyrg.pop_back();
				srg.pop_back();
			}
		}
		
		return ans;
	}
	
	while( vc.size() > 0 ){
		for( i = 1; i < vc.size(); i ++ ){
			if( vc[i] == vc[0] * -1 ){
				if( vc[i] < 0 ){
					ans += i;
					vc.erase( vc.begin() + i );
					vc.erase( vc.begin() + 0 );
					break;
				}
				else{
					ans += i-1;
					vc.erase( vc.begin() + i );
					vc.erase( vc.begin() + 0 );
					break;
				}
			}
		}
	}
	return ans;
}

Compilation message

shoes.cpp: In function 'int count_swaps(std::vector<int>)':
shoes.cpp:15:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for( i = 1; i < vc.size(); i ++ ){
      |              ~~^~~~~~~~~~~
shoes.cpp:26:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for( i = 0; i < vc.size(); i ++ ){
      |               ~~^~~~~~~~~~~
shoes.cpp:34:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |   for( i = 0; i < vc.size()-1; i ++ ){
      |               ~~^~~~~~~~~~~~~
shoes.cpp:55:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |   for( i = 1; i < vc.size(); i ++ ){
      |               ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Incorrect 0 ms 288 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 0 ms 288 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Incorrect 0 ms 288 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Incorrect 0 ms 288 KB Output isn't correct
17 Halted 0 ms 0 KB -