Submission #1123135

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1123135	2024-12-02 09:33:22	razivo	The Xana coup (BOI21_xanadu)	C++20	70 / 100	177 ms	38152 KiB

xanadu

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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int n;
vector<vector<int>> g(100000);
vector<int> are(100000);
vector<vector<vector<int>>> on(100000,vector<vector<int>>(2,vector<int>(2,0)));
pair<int,int> beo(vector<pair<int,int>> &u) {
    vector<pair<int,int>> d;
    d.reserve(u.size());
    int sum = 0;
    for (int i = 0; i < u.size(); ++i) {
        d.emplace_back(u[i].second-u[i].first,i);
        sum+=u[i].first;
    }
    if(d.size()>0)sort(d.begin(),d.end());
    int be=sum,bo=2e5;
    for (int i = 0; i < d.size(); ++i) {
        sum+=d[i].first;
        if(i%2==1) be=min(be,sum);
        else bo = min(bo,sum);
    }
    return {be,bo};
}
int check(bool ch,bool me, bool p, vector<vector<vector<int>>> &t) {
    vector<pair<int,int>> d;
    int v = me ? 1 : 0;
    for (auto & i : t) {
        d.emplace_back(i[0][v],i[1][v]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 40 / 40
• Subtask 5: 0 / 30