Submission #206029

#	Time	Username	Problem	Language	Result	Execution time	Memory
206029		Segtree	Sorting (IOI15_sorting)	C++14	0 / 100	8 ms	408 KiB

sorting

#include"sorting.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[]){
	for(int i=0;i<N-1;i++){
		ll p;
		for(int j=0;j<N;j++)if(S[j]==i)p=j;
		P[i]=i,Q[i]=p;
		swap(S[i],S[p]);
	}
	ll R=N;
	//rep(i,R)cout<<"PQ:"<<P[i]<<" "<<Q[i]<<endl;
	return R;
}/*
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 (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:18:15: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   P[i]=i,Q[i]=p;
               ^
sorting.cpp:23:9: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return R;
         ^
sorting.cpp:14:37: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
                                     ^
sorting.cpp:14:45: warning: unused parameter 'X' [-Wunused-parameter]
 int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
                                             ^
sorting.cpp:14:53: warning: unused parameter 'Y' [-Wunused-parameter]
 int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[]){
                                                     ^
sorting.cpp:19:16: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
   swap(S[i],S[p]);
                ^

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26