oj.uz

Submission #1040198

# Submission time Handle Problem Language Result Execution time Memory
1040198 2024-07-31T18:11:52 Z Zicrus Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 29604 KB 
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

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

#define SWAP(x, y) t=(x);(x)=(y);(y)=(t)

ll t;
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P1[], int Q1[]) {
    ll h[200000];
    for (ll i = 0; i < N; i++) h[i] = S[i];
 
    ll ooo = 0;
    for (ll i = 0; i < N; i++) {
        if (h[i] != i) ooo++;
    }
    if (ooo == 0) return 0;
    
    int P[200000], Q[200000]; //
 
    ll revH[200000];
    for (int i = 0; i < N; i++) {
        revH[h[i]] = i;
    }
 
    ll res1 =0;
    ll low = 1, high = N;

    ll s[200000], order[200000], revOrd[200000], revS[200000];
    while (low < high) {
        ll g = (low + high) / 2;
 
        ll res = 0;
        memcpy(s, h, N * sizeof(ll));
        memcpy(order, h, N * sizeof(ll));
        memcpy(revOrd, revH, N * sizeof(ll));
        memcpy(revS, revH, N * sizeof(ll));
        for (ll j = 0; j < g; j++) {
            SWAP(order[X[j]], order[Y[j]]);
            SWAP(revOrd[order[X[j]]], revOrd[order[Y[j]]]);
        }
        ll id1 = -1;
        for (ll i = 0; i < g; i++) {
            SWAP(s[X[i]], s[Y[i]]);
            SWAP(revS[s[X[i]]], revS[s[Y[i]]]);
            int firstOut = -1, id = -1;
            for (int j = id1+1; j < N; j++) {
                if (order[j] != j) {
                    firstOut = order[id = j];
                    break;
                }
            }
            id1 = id;
            if (firstOut == -1) {
                P[res] = Q[res] = 0;
                res++;
            }
            else {
                ll iter = revOrd[id];
                ll v = order[iter];
 
                ll id1 = revS[firstOut];
                ll id2 = revS[v];
                SWAP(s[id1], s[id2]);
                SWAP(revS[s[id1]], revS[s[id2]]);
                SWAP(order[iter], order[id]);
                SWAP(revOrd[order[iter]], revOrd[order[id]]);
                P[res] = id1;
                Q[res] = id2;
                res++;
            }
        }
        ll ooo = 0;
        for (ll i = 0; i < N; i++) {
            if (s[i] != i) ooo++;
        }
        if (ooo == 0) {
            res1 = res;
            high = res;
 
            memcpy(P1, P, res * sizeof(int));
            memcpy(Q1, Q, res * sizeof(int));
        }else {
            low = g+1;
        }
    }
	return res1;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:52:29: warning: conversion from 'll' {aka 'long int'} to 'int' may change value [-Wconversion]
   52 |             for (int j = id1+1; j < N; j++) {
      |                          ~~~^~
sorting.cpp:54:44: warning: conversion from 'll' {aka 'long int'} to 'int' may change value [-Wconversion]
   54 |                     firstOut = order[id = j];
      |                                ~~~~~~~~~~~~^
sorting.cpp:67:20: warning: declaration of 'id1' shadows a previous local [-Wshadow]
   67 |                 ll id1 = revS[firstOut];
      |                    ^~~
sorting.cpp:47:12: note: shadowed declaration is here
   47 |         ll id1 = -1;
      |            ^~~
sorting.cpp:73:26: warning: conversion from 'll' {aka 'long int'} to 'int' may change value [-Wconversion]
   73 |                 P[res] = id1;
      |                          ^~~
sorting.cpp:74:26: warning: conversion from 'll' {aka 'long int'} to 'int' may change value [-Wconversion]
   74 |                 Q[res] = id2;
      |                          ^~~
sorting.cpp:78:12: warning: declaration of 'ooo' shadows a previous local [-Wshadow]
   78 |         ll ooo = 0;
      |            ^~~
sorting.cpp:18:8: note: shadowed declaration is here
   18 |     ll ooo = 0;
      |        ^~~
sorting.cpp:92:9: warning: conversion from 'll' {aka 'long int'} to 'int' may change value [-Wconversion]
   92 |  return res1;
      |         ^~~~
sorting.cpp:14:39: warning: unused parameter 'M' [-Wunused-parameter]
   14 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P1[], int Q1[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11364 KB Output is correct
2 Correct 4 ms 11356 KB Output is correct
3 Correct 5 ms 11344 KB Output is correct
4 Correct 5 ms 11320 KB Output is correct
5 Correct 5 ms 11276 KB Output is correct
6 Correct 5 ms 11184 KB Output is correct
7 Correct 5 ms 11352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11364 KB Output is correct
2 Correct 4 ms 11356 KB Output is correct
3 Correct 5 ms 11344 KB Output is correct
4 Correct 5 ms 11320 KB Output is correct
5 Correct 5 ms 11276 KB Output is correct
6 Correct 5 ms 11184 KB Output is correct
7 Correct 5 ms 11352 KB Output is correct
8 Correct 5 ms 11352 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 11356 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 11364 KB Output is correct
2 Correct 4 ms 11356 KB Output is correct
3 Correct 5 ms 11344 KB Output is correct
4 Correct 5 ms 11320 KB Output is correct
5 Correct 5 ms 11276 KB Output is correct
6 Correct 5 ms 11184 KB Output is correct
7 Correct 5 ms 11352 KB Output is correct
8 Correct 5 ms 11352 KB Output is correct
9 Correct 5 ms 11356 KB Output is correct
10 Correct 5 ms 11356 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 5 ms 11356 KB Output is correct
13 Correct 4 ms 11352 KB Output is correct
14 Correct 5 ms 11356 KB Output is correct
15 Correct 5 ms 11356 KB Output is correct
16 Correct 5 ms 11356 KB Output is correct
17 Correct 5 ms 11352 KB Output is correct
18 Correct 5 ms 11356 KB Output is correct
19 Correct 6 ms 11352 KB Output is correct
20 Correct 5 ms 11356 KB Output is correct
21 Correct 5 ms 11528 KB Output is correct
22 Correct 6 ms 11380 KB Output is correct
23 Correct 5 ms 11620 KB Output is correct
24 Correct 5 ms 11528 KB Output is correct
25 Correct 6 ms 11612 KB Output is correct
26 Correct 6 ms 11416 KB Output is correct
27 Correct 5 ms 11608 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11356 KB Output is correct
2 Correct 5 ms 11456 KB Output is correct
3 Correct 5 ms 11528 KB Output is correct
4 Correct 5 ms 11356 KB Output is correct
5 Correct 5 ms 11356 KB Output is correct
6 Correct 5 ms 11356 KB Output is correct
7 Correct 5 ms 11356 KB Output is correct
8 Correct 6 ms 11604 KB Output is correct
9 Correct 6 ms 11356 KB Output is correct
10 Correct 5 ms 11456 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 6 ms 11356 KB Output is correct
13 Correct 6 ms 11524 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11356 KB Output is correct
2 Correct 5 ms 11456 KB Output is correct
3 Correct 5 ms 11528 KB Output is correct
4 Correct 5 ms 11356 KB Output is correct
5 Correct 5 ms 11356 KB Output is correct
6 Correct 5 ms 11356 KB Output is correct
7 Correct 5 ms 11356 KB Output is correct
8 Correct 6 ms 11604 KB Output is correct
9 Correct 6 ms 11356 KB Output is correct
10 Correct 5 ms 11456 KB Output is correct
11 Correct 5 ms 11356 KB Output is correct
12 Correct 6 ms 11356 KB Output is correct
13 Correct 6 ms 11524 KB Output is correct
14 Correct 6 ms 11356 KB Output is correct
15 Correct 111 ms 27560 KB Output is correct
16 Correct 121 ms 27884 KB Output is correct
17 Correct 140 ms 28752 KB Output is correct
18 Correct 38 ms 24428 KB Output is correct
19 Correct 96 ms 27212 KB Output is correct
20 Correct 632 ms 27992 KB Output is correct
21 Correct 565 ms 27988 KB Output is correct
22 Correct 117 ms 24144 KB Output is correct
23 Correct 125 ms 29604 KB Output is correct
24 Correct 145 ms 29264 KB Output is correct
25 Correct 140 ms 29008 KB Output is correct
26 Correct 112 ms 27724 KB Output is correct
27 Execution timed out 1026 ms 25288 KB Time limit exceeded
28 Halted 0 ms 0 KB -