oj.uz

답안 #590835

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
590835 2022-07-06T12:11:59 Z FatihSolak 정렬하기 (IOI15_sorting) C++17
16 / 100
 7 ms 452 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
int get(vector<int> a,int target){
	for(int i = 0;i<a.size();i++){
		if(a[i] == target)
			return i;
	}
}
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
	if(is_sorted(s,s+n))
		return 0;
	for(int i = 0;i<m;i++){
		p[i] = q[i] = 0;
	}
	vector<int> final;
	vector<int> now;
	for(int i = 0;i<n;i++){
		final.push_back(s[i]);
		now.push_back(s[i]);
	}
	for(int i = 0;i<m;i++){
		swap(final[x[i]],final[y[i]]);
	}
	for(int i = 0;i<n;i++){
		swap(now[x[i]],now[y[i]]);
		int ps1 = get(now,i);
		int ps2 = get(now,final[i]);
		p[i] = ps1;
		q[i] = ps2;
		swap(now[ps1],now[ps2]);
		swap(final[i],final[get(final,i)]);
	}
	assert(is_sorted(final.begin(),final.end()));
	return m;
}

Compilation message

sorting.cpp: In function 'int get(std::vector<int>, int)':
sorting.cpp:5:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 |  for(int i = 0;i<a.size();i++){
      |                ~^~~~~~~~~
sorting.cpp:9:1: warning: control reaches end of non-void function [-Wreturn-type]
    9 | }
      | ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 452 KB Output isn't correct
2 Halted 0 ms 0 KB -