Submission #794286

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
794286	2023-07-26 12:05:44	puppy	Flip it and Stick it (CCO23_day2problem1)	C++17	25 / 25	6 ms	2216 KiB

Main

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 <string>
#include <algorithm>
#include <vector>
#include <numeric>
#include <ctime>
#include <cstdlib>
using namespace std;
string s, t;
void flip(string &s)
{
    for (int i = 0; i < (int)s.size(); i++) {
        s[i] = s[i] == '0' ? '1' : '0';
    }
}
int minimum_cost(vector<int> v)
{
    int zr = accumulate(v.begin(), v.end(), 0), on = (int)v.size() - 1;
    if (zr > 2 * (on + 1)) return -1;
    int one = 0, zero = 0;
    vector<int> up;
    for (int i:v) {
        if (i == 1) one++;
        else if (i == 0) zero++;
        else if (i >= 3) up.push_back(i);
    }
    int req_one = 0;
    for (int &i:up) {
        if (i % 2 == 1) {
            req_one++; i--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 7 / 7