oj.uz

Submission #1080999

# Submission time Handle Problem Language Result Execution time Memory
1080999 2024-08-29T16:49:32 Z Trumling Sorting (IOI15_sorting) C++14
0 / 100
 1 ms 440 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 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;
 
 
    
    for(int i=0;i<N;i++)
    {
        P[i]=pos[i];
        Q[i]=i;
        swap(S[pos[i]],S[i]);
        pos[S[pos[i]]]=pos[i];
        pos[i]=i;
 
    }
  if(N==1)
    return 0;
  else
    return N;
        
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:25:19: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   25 |         P[i]=pos[i];
      |              ~~~~~^
sorting.cpp:14:39: warning: unused parameter 'M' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                   ~~~~^
sorting.cpp:14:46: warning: unused parameter 'X' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                          ~~~~^~~
sorting.cpp:14:55: warning: unused parameter 'Y' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                                   ~~~~^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 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 0 ms 348 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 0 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 1 ms 440 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

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