Submission #1353749

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353749		Francisco_Martin	Data Centers (EGOI22_datacenters)	C++20	33 / 100	2092 ms	3012 KiB

Main

//EGOI 2022 Data Centers
//https://qoj.ac/contest/2260/problem/5182

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;

int main(){
    ll n, q, a, b;
    cin >> n >> q;
    vll A(n);
    for(int i=0; i<n; i++) cin >> A[i];
    auto mysort=[&](ll x){
        ll l=0, r=x; vll B;
        while(l<x || r<n){
            if((r==n) || (l!=x && A[l]>=A[r])) B.push_back(A[l++]);
            else B.push_back(A[r++]);
        }
        A=B;
    };
    sort(A.rbegin(),A.rend());
    for(int i=0; i<q; i++){
        cin >> a >> b;
        for(int j=0; j<b; j++) A[j]-=a;
        mysort(b);
    }
    for(int i=0; i<n; i++) cout << A[i] << " ";
    cout << "\n";
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 9 / 9
• Subtask 4: 0 / 26
• Subtask 5: 0 / 18
• Subtask 6: 0 / 23