oj.uz

Submission #1081589

# Submission time Handle Problem Language Result Execution time Memory
1081589 2024-08-30T07:49:43 Z Trumling Sorting (IOI15_sorting) C++14
0 / 100
 1 ms 604 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;
 
 
 
int findSwapPairs(int N, int ar[], int M, int X[], int Y[], int P[], int Q[]) 
{ 

    int pos[N];
	int arr[N];
    for(int i=0;i<N;i++)
    {
	  arr[i]=ar[i];
      pos[arr[i]]=i;
    }
        
 
 	vector<pair<ll,ll>>v;
    for(int i=0;i<N;i++)
    {
     	v.pb({pos[i],i});
        swap(arr[pos[i]],arr[i]);
        pos[arr[pos[i]]]=pos[i];
        pos[i]=i;
 
    }
    
 assert(is_sorted(arr,arr+N));
 for(int i=0;i<v.size();i++)
             {
               P[i]=v[i].F;
               Q[i]=v[i].S;
             }
			
    return v.size();
        
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:37:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |  for(int i=0;i<v.size();i++)
      |              ~^~~~~~~~~
sorting.cpp:5:11: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
    5 | #define F first
sorting.cpp:39:26: note: in expansion of macro 'F'
   39 |                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:40:26: note: in expansion of macro 'S'
   40 |                Q[i]=v[i].S;
      |                          ^
sorting.cpp:43:18: warning: conversion from 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   43 |     return v.size();
      |            ~~~~~~^~
sorting.cpp:14:40: warning: unused parameter 'M' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int ar[], int M, int X[], int Y[], int P[], int Q[])
      |                                    ~~~~^
sorting.cpp:14:47: warning: unused parameter 'X' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int ar[], int M, int X[], int Y[], int P[], int Q[])
      |                                           ~~~~^~~
sorting.cpp:14:56: warning: unused parameter 'Y' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int ar[], 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 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 KB Output is correct
2 Incorrect 1 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 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 604 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 604 KB Output isn't correct
2 Halted 0 ms 0 KB -