oj.uz

Submission #317929

# Submission time Handle Problem Language Result Execution time Memory
317929 2020-10-30T20:28:43 Z keta_tsimakuridze Sorting (IOI15_sorting) C++14
100 / 100
 307 ms 21992 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#include "sorting.h"
using namespace std;
int findSwapPairs(int N, int A[], int M, int x[], int y[], int P[], int Q[]) {
    int l=0; int r=M;
    std::vector<std::pair<int,int> > V,ans;
    int a[N+5],ind[N+5];
    while(l<=r){
    	V.clear();
    	int mid=(l+r)/2;
    	for(int i=0;i<N;i++){
    		ind[A[i]]=i;
    		a[i]=A[i];
		}
		for(int i=0;i<mid;i++){
			std::swap(a[x[i]],a[y[i]]);
		}
		for(int i=0;i<N;i++){
			ind[a[i]]=i;
		}	
		
		for(int i=0;i<N;i++){
			if(a[i]!=i){
			V.push_back(std::make_pair(a[i],i));
				std::swap(a[i],a[ind[i]]);		
				std::swap(ind[a[ind[i]]],ind[i]);	
			}
		}
	
		for(int i=0;i<N;i++){
			a[i]=A[i];
			ind[a[i]]=i;
		}
		if(V.size()<=mid) {
			ans.clear(); 
			for(int i=0;i<mid;i++){
			std::swap(ind[a[x[i]]],ind[a[y[i]]]);
			std::swap(a[x[i]],a[y[i]]);
			if(i<V.size() ){
				// V[i].f V[i].s 
				swap(ind[V[i].f],ind[V[i].s]);
				swap(a[ind[V[i].f]],a[ind[V[i].s]]);
				ans.push_back(make_pair(ind[V[i].f],ind[V[i].s]));
			}
			else ans.push_back(make_pair(0,0));
		}
			
			r=mid-1;
		}
		else l=mid+1;
	} 
	for(int i=0;i<ans.size();i++){
	P[i]=ans[i].first;
	Q[i]=ans[i].second;
	}
	return ans.size();
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:36:14: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |   if(V.size()<=mid) {
      |      ~~~~~~~~^~~~~
sorting.cpp:41:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |    if(i<V.size() ){
      |       ~^~~~~~~~~
sorting.cpp:54:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i=0;i<ans.size();i++){
      |              ~^~~~~~~~~~~
sorting.cpp:58:17: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   58 |  return ans.size();
      |         ~~~~~~~~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory 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 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory 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 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 2 ms 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 2 ms 640 KB Output is correct
26 Correct 2 ms 640 KB Output is correct
27 Correct 2 ms 640 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 576 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 225 ms 19816 KB Output is correct
16 Correct 268 ms 20200 KB Output is correct
17 Correct 271 ms 21096 KB Output is correct
18 Correct 121 ms 20456 KB Output is correct
19 Correct 203 ms 21480 KB Output is correct
20 Correct 215 ms 21864 KB Output is correct
21 Correct 207 ms 21992 KB Output is correct
22 Correct 218 ms 16360 KB Output is correct
23 Correct 251 ms 21736 KB Output is correct
24 Correct 292 ms 21484 KB Output is correct
25 Correct 307 ms 21228 KB Output is correct
26 Correct 217 ms 20968 KB Output is correct
27 Correct 200 ms 20584 KB Output is correct
28 Correct 267 ms 21608 KB Output is correct
29 Correct 282 ms 21096 KB Output is correct
30 Correct 166 ms 20584 KB Output is correct
31 Correct 293 ms 21480 KB Output is correct
32 Correct 250 ms 21096 KB Output is correct
33 Correct 304 ms 21480 KB Output is correct
34 Correct 261 ms 21352 KB Output is correct
35 Correct 200 ms 21224 KB Output is correct
36 Correct 94 ms 20200 KB Output is correct
37 Correct 295 ms 21728 KB Output is correct
38 Correct 271 ms 20968 KB Output is correct
39 Correct 286 ms 21096 KB Output is correct