oj.uz

답안 #147398

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147398 2019-08-29T12:46:02 Z mosiashvililuka Arranging Shoes (IOI19_shoes) C++14
25 / 100
 34 ms 3448 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,f[200009];
long long count_swaps(vector <int> S){
a=S.size();
	for(b=1; b<=a; b++) f[b]=S[b-1];
	if(a==2){
	if(f[1]<0) return 0LL; else return 1LL;
	}else{
      a/=2;
		return (a-1)*a/2;
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 34 ms 3448 KB Output is correct
6 Correct 32 ms 3448 KB Output is correct
7 Correct 32 ms 3448 KB Output is correct
8 Correct 31 ms 3448 KB Output is correct
9 Correct 33 ms 3448 KB Output is correct
10 Correct 32 ms 3448 KB Output is correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 15.0

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