Submission #524550

#TimeUsernameProblemLanguageResultExecution timeMemory
524550LoboSorting (IOI15_sorting)C++17
20 / 100
1 ms460 KiB
#include "sorting.h" #include<bits/stdc++.h> using namespace std; const long long inf = (long long) 1e18 + 10; const int inf1 = (int) 1e9 + 10; #define int long long #define dbl long double #define endl '\n' #define sc second #define fr first #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() #define maxn 55000 int n, m, a[maxn], pos[maxn], s1[maxn], s2[maxn]; int32_t findSwapPairs(int32_t N, int32_t S[], int32_t M, int32_t X[], int32_t Y[], int32_t P[], int32_t Q[]) { n = N; m = M; for(int i = 0; i < n; i++) { a[i] = S[i]; pos[a[i]] = i; } for(int i = 0; i < m; i++) { s1[i] = X[i]; s2[i] = Y[i]; } int32_t R = 0; for(int i = 0; i < n; i++) { if(pos[i] != i) { //swap a[i] and a[pos[i]] P[R] = i; Q[R] = pos[i]; //pos[i] = i //pos[a[i]] = pos[i] swap(pos[i],pos[a[i]]); swap(a[P[R]],a[Q[R]]); R++; } } return R; }

Compilation message (stderr)

sorting.cpp: In function 'int32_t findSwapPairs(int32_t, int32_t*, int32_t, int32_t*, int32_t*, int32_t*, int32_t*)':
sorting.cpp:37:20: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
   37 |             P[R] = i;
      |                    ^
sorting.cpp:38:25: warning: conversion from 'long long int' to 'int32_t' {aka 'int'} may change value [-Wconversion]
   38 |             Q[R] = pos[i];
      |                    ~~~~~^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...