oj.uz

Submission #1080962

# Submission time Handle Problem Language Result Execution time Memory
1080962 2024-08-29T16:21:22 Z Trumling Sorting (IOI15_sorting) C++14
0 / 100
 3 ms 432 KB 
#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 Se[], int M, int X[], int Y[], int P[], int Q[]) 
{ 
	n=N;

	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++)
			if(Se[j]==i)
			{

			P[i]=min(j,i);
			Q[i]=max(i,j);
			swap(Se[j],Se[i]);
			}

	return N;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:13:40: warning: unused parameter 'M' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[])
      |                                    ~~~~^
sorting.cpp:13:47: warning: unused parameter 'X' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[])
      |                                           ~~~~^~~
sorting.cpp:13:56: warning: unused parameter 'Y' [-Wunused-parameter]
   13 | int findSwapPairs(int N, int Se[], int M, int X[], int Y[], int P[], int Q[])
      |                                                    ~~~~^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -