Submission #1080894

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080894		Trumling	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	604 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;
ll n;

 int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) 
{ 
	n=N;
    ll pos[N];
    for(int i=0;i<N;i++)
		pos[S[i]]=i;
	
	vector<deque<pair<ll,pair<ll,ll>>>>v;
	for(int i=0;i<M;i++)
		v[Y[i]].pb({X[i],{v[X[i]].size()-1,i}});

	
	
	for(int i=0;i<M;i++)
	{
		pos[S[X[i]]]=Y[i];
		pos[S[Y[i]]]=X[i];
		swap(S[X[i]],S[Y[i]]);

		if(i<N)
		{
			ll posi=i;
			ll idx=v[i].size()-1;
			ll ii=((v[i].size())?v[i][v[i].size()-1].S.S:-1);
			while(ii>i)
			{
				ll posi2=v[posi][idx].F;
				ll idx2=v[posi][idx].S.F;
				ll ii2=v[posi][idx].S.S;

				if(ii2<=i)
					break;
				
				posi=posi2;
				idx=idx2;
				ii2=ii;
			}

			P[i]=posi;
			Q[i]=pos[i];

			swap(S[posi],S[pos[i]]);
			pos[S[pos[i]]]=pos[i];
			pos[i]=posi;
			
		}
		else
		{
			P[i]=0;
			Q[i]=0;
		}
	}

		

		
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:51:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   51 |    P[i]=posi;
      |         ^~~~
sorting.cpp:52:14: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   52 |    Q[i]=pos[i];
      |         ~~~~~^
sorting.cpp:69:1: warning: no return statement in function returning non-void [-Wreturn-type]
   69 | }
      | ^

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