Submission #1079951

#	Time	Username	Problem	Language	Result	Execution time	Memory
1079951		Trumling	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	600 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(),x.end()
#define INF 9999999999999999
typedef long long ll;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {

	vector<pair<ll,ll>>v;

    for(int i=0;i<M;i++)
			v.pb({P[i],Q[i]});
		
	vector<int>s(N);
	ll r=0;
	do
	{
		for(int i=0;i<N;i++)
			s[i]=S[i];
		
		for(int i=0;i<M;i++)
		{
			swap(s[v[i].F],s[v[i].S]);
			bool tf=1;
			for(int j=0;j<N-1;j++)
				if(s[j]>s[j+1])
					{
						tf=0;
						break;
					}
				
			if(tf)
			{
				r=i+1;
				break;
			}
		}
	if(r!=0)
		break;

	} while (next_permutation(all(v)));

	for(int i=0;i<r;i++)
		{
			P[i]=v[i].F;
			Q[i]=v[i].S;
		}
	

	return r;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    5 | #define F first
sorting.cpp:50:14: note: in expansion of macro 'F'
   50 |    P[i]=v[i].F;
      |              ^
sorting.cpp:6:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    6 | #define S second
sorting.cpp:51:14: note: in expansion of macro 'S'
   51 |    Q[i]=v[i].S;
      |              ^
sorting.cpp:55:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   55 |  return r;
      |         ^
sorting.cpp:12:46: warning: unused parameter 'X' [-Wunused-parameter]
   12 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:12:55: warning: unused parameter 'Y' [-Wunused-parameter]
   12 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~

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