Submission #887303

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
887303	2023-12-14 08:49:41	votranngocvy	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	922 ms	33108 KiB

sortbooks

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
int a[N],l[N],r[N],k[N],n,m;
namespace sub1 {
    int b[N];
    void solve() {
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) b[j] = a[j];
            bool check = true;
            for (int j = l[i]; j < r[i]; j++)
                if (b[j] > b[j + 1]) {
                    check = false;
                    break;
                }
            while (!check) {
                bool found = false;
                for (int j = l[i]; j < r[i]; j++)
                    if (b[j] > b[j + 1]) {
                        if (b[j] + b[j + 1] <= k[i]) swap(b[j],b[j + 1]);
                        else found = true;
                        break;
                    }
                if (found) break;
                check = true;
                for (int j = l[i]; j < r[i]; j++)
                if (b[j] > b[j + 1]) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23