oj.uz

Submission #833954

# Submission time Handle Problem Language Result Execution time Memory
833954 2023-08-22T09:46:47 Z Ellinor Sorting (IOI15_sorting) C++14
36 / 100
 1 ms 616 KB 
//#include<bits/stdc++.h>
#include <iostream>
#include <vector>
#include <queue>
#include <string>
#include <cmath>
#include <cstdlib>
#include <set>
#include <iomanip>
#include <limits>
#include <map>
#include <assert.h>
#include <algorithm>
#include <list>
#include <iterator>
#include <fstream>
#include <random>
#include <unordered_map>
#include <array>
using namespace std;

#define rep(i,a,b) for (int i = (a); i < b; i++)
#define pb push_back
#define all(x) x.begin(), x.end()
typedef long long ll;
//typedef pair<int, int> pii;

// fast

vector<int> S;
vector<int> at;

#include "sorting.h" // !!

void swap(int a, int b)
{
    int tmp = S[a];
    S[a] = S[b];
    S[b] = tmp;

    at[S[a]] = a;
    at[S[b]] = b;
}

int findSwapPairs(int N, int ss[], int M, int X[], int Y[], int P[], int Q[])
{
    S.assign(N, 0);
    rep(i,0,N) {
        S[i] = ss[i];
    }

    at.assign(N, 0);
    rep(i,0,N) {
        at[S[i]] = i;
    }

    int R = 0;
    rep(i,2,N)
    {
        if (S[i] != i) 
        {
            swap(X[R], Y[R]);
            P[R] = at[i];
            Q[R] = i;
            swap(at[i], i);
            R++;
        }
    }

    if (S[0] != 0) 
    {
        swap(X[R], Y[R]);
        if (S[0] != 0)
        {
            P[R] = at[0];
            Q[R] = 0;
            swap(at[0], 0);
        }
        else
        {
            P[R] = 0;
            Q[R] = 0;
            //swap(0, 0);
        }
        R++;
    }

    rep(i,0,N) if(S[i] != i) assert(0 == 1);

	return R;
}

// 20p, 0, 0
// 16p, 0, 1, first all else, then 1 -> 1 (if needed)

Compilation message

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Runtime error 1 ms 596 KB Execution killed with signal 6
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 616 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 616 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -