oj.uz

Submission #206052

# Submission time Handle Problem Language Result Execution time Memory
206052 2020-03-02T03:48:50 Z Segtree Sorting (IOI15_sorting) C++14
74 / 100
 57 ms 18080 KB 
#include"sorting.h"
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x,begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
	bool sorted=1;
	rep(i,N)sorted&=(S[i]==i);
	if(sorted)return 0;
	
	int ss[2010];
	rep(i,N)ss[i]=S[i];
	int R=0;
	for(;;R++){
		swap(S[X[R]],S[Y[R]]);
		ll cnt=0,s[2010],pl[2010];
		rep(i,N)s[i]=S[i],pl[s[i]]=i;
		rep(i,N){
			ll p=pl[i];
			if(i!=p){
				P[cnt]=s[i],Q[cnt]=s[p];
				cnt++;
				swap(s[i],s[p]);
				swap(pl[s[i]],pl[s[p]]);
			}
		}
		if(cnt<=R+1){
			R++;
			for(;cnt<R;cnt++)P[cnt]=Q[cnt]=0;
			for(int i=0;i<R;i++){
				swap(ss[X[i]],ss[Y[i]]);
				ll place_p,place_q;
				rep(j,N){
					if(ss[j]==P[i])place_p=j;
					if(ss[j]==Q[i])place_q=j;
				}
				swap(ss[place_p],ss[place_q]);
				P[i]=place_p,Q[i]=place_q;
			}
			return R;
		}
	}
	return -1;
}
/*
int main(){
	int n,s[100],m,x[1000],y[1000],p[1000],q[1000];
	cin>>n;
	rep(i,n)cin>>s[i];
	cin>>m;
	rep(i,m){
		cin>>x[i]>>y[i];
	}
	cout<<"R="<<findSwapPairs(n,s,m,x,y,p,q)<<endl;
}*/

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:30:15: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     P[cnt]=s[i],Q[cnt]=s[p];
            ~~~^
sorting.cpp:30:27: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     P[cnt]=s[i],Q[cnt]=s[p];
                        ~~~^
sorting.cpp:47:10: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     P[i]=place_p,Q[i]=place_q;
          ^~~~~~~
sorting.cpp:47:23: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
     P[i]=place_p,Q[i]=place_q;
                       ^~~~~~~
sorting.cpp:15:37: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
                                     ^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 5 ms 256 KB Output is correct
21 Correct 8 ms 504 KB Output is correct
22 Correct 8 ms 412 KB Output is correct
23 Correct 8 ms 632 KB Output is correct
24 Correct 7 ms 504 KB Output is correct
25 Correct 6 ms 504 KB Output is correct
26 Correct 7 ms 504 KB Output is correct
27 Correct 7 ms 504 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 376 KB Output is correct
2 Correct 53 ms 504 KB Output is correct
3 Correct 49 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 10 ms 504 KB Output is correct
7 Correct 22 ms 504 KB Output is correct
8 Correct 51 ms 504 KB Output is correct
9 Correct 52 ms 504 KB Output is correct
10 Correct 53 ms 504 KB Output is correct
11 Correct 46 ms 528 KB Output is correct
12 Correct 22 ms 504 KB Output is correct
13 Correct 42 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 376 KB Output is correct
2 Correct 53 ms 504 KB Output is correct
3 Correct 49 ms 504 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 10 ms 504 KB Output is correct
7 Correct 22 ms 504 KB Output is correct
8 Correct 51 ms 504 KB Output is correct
9 Correct 52 ms 504 KB Output is correct
10 Correct 53 ms 504 KB Output is correct
11 Correct 46 ms 528 KB Output is correct
12 Correct 22 ms 504 KB Output is correct
13 Correct 42 ms 504 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Runtime error 57 ms 18080 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Halted 0 ms 0 KB -