Submission #1039868

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039868		Zicrus	Sorting (IOI15_sorting)	C++17	20 / 100	1 ms	504 KiB

sorting

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;

typedef long long ll;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    ll stkPtr = 0;
    vector<ll> s(N);
    for (int i = 0; i < N; i++) s[i] = S[i];
    for (int i = 2; i < min(N, M); i++) {
        swap(X[i], Y[i]);
        ll id = find(s.begin(), s.end(), i) - s.begin();
        if (i == id) continue;
        swap(s[i], s[id]);
        P[stkPtr] = i;
        Q[stkPtr] = id;
        stkPtr++;
    }
    if (stkPtr < M) {
        if (s[0] == 0) {
            P[stkPtr] = 0;
            Q[stkPtr] = 0;
            stkPtr++;
        }
        else {
            P[stkPtr] = 0;
            Q[stkPtr] = 1;
            stkPtr++;
        }
    }
	return stkPtr;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:17:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   17 |         Q[stkPtr] = id;
      |                     ^~
sorting.cpp:32:9: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   32 |  return stkPtr;
      |         ^~~~~~

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