oj.uz

Submission #590852

# Submission time Handle Problem Language Result Execution time Memory
590852 2022-07-06T12:18:22 Z FatihSolak Sorting (IOI15_sorting) C++17
20 / 100
 2 ms 596 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;
	}
	assert(0);
}
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> fnal;
	vector<int> now;
	for(int i = 0;i<n;i++){
		fnal.push_back(s[i]);
		now.push_back(s[i]);
	}
	for(int i = 0;i<m;i++){
		swap(fnal[x[i]],fnal[y[i]]);
	}
	for(int i = 0;i<n-1;i++){
		swap(now[x[i]],now[y[i]]);
		int ps1 = get(now,i);
		int ps2 = get(now,fnal[i]);
		p[i] = ps1;
		q[i] = ps2;
		swap(now[ps1],now[ps2]);
		swap(fnal[i],fnal[get(fnal,i)]);
		if(is_sorted(fnal.begin(),fnal.end()))
			return i+1;
		assert(now == fnal);
	}
	assert(is_sorted(fnal.begin(),fnal.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++){
      |                ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 1 ms 340 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 304 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Runtime error 1 ms 340 KB Execution killed with signal 6
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 596 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -