| Task: | Key cutting |
| Sender: | Orangutans |
| Submission time: | 2024-11-16 13:19:21 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.02 s | details |
| #10 | ACCEPTED | 0.02 s | details |
| #11 | ACCEPTED | 0.02 s | details |
| #12 | ACCEPTED | 0.02 s | details |
| #13 | ACCEPTED | 0.03 s | details |
| #14 | ACCEPTED | 0.03 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:9:12: warning: unused variable 'm' [-Wunused-variable]
9 | int n, m;
| ^Code
#include <vector>
#include <string>
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n, m;
cin >> n;
vector<int> v = vector<int>(n);
for (int i = 0; i < n ; ++i){
cin >> v[i];
}
int count = 0;
bool change = true;
while (change){
change = false;
for (int i = 0; i < n; ++i){
int x = 0;
int min = v[i];
for (int j = i; j < n && v[j] != 0; ++j){
if (v[j] < min)
min = v[j];
++x;
}
if ( x!= 0 || min != 0){
//for (int t = 0; t < n; ++t)
//cout << v[t] << " ";
for (int j = 0; j < x; ++j){
v[i + j] -= min;
if (j == 0)
count++;
change = true;
}
if (change)
i--;
//cout << "\t:: " <<i << ": " << x <<" "<< min << endl;
}
}
}
cout << count << endl;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 3 1 2 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1 0 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 1 9 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 100 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 100 0 0 0 1 1 0 0 0 0 1 1 1 0 1 1 ... |
| correct output |
|---|
| 25 |
| user output |
|---|
| 25 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 100 2 1 2 1 2 0 0 0 1 1 2 2 1 2 2 ... |
| correct output |
|---|
| 41 |
| user output |
|---|
| 41 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100 36 5 10 37 94 59 20 31 64 2 58... |
| correct output |
|---|
| 99 |
| user output |
|---|
| 99 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100 228768416 32415139 952687252 6... |
| correct output |
|---|
| 100 |
| user output |
|---|
| 100 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100000 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 ... |
| correct output |
|---|
| 24965 |
| user output |
|---|
| 24965 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100000 2 1 2 2 2 2 2 1 1 0 1 1 0 1 1 ... |
| correct output |
|---|
| 38968 |
| user output |
|---|
| 38968 |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 100000 4 4 5 4 4 5 0 2 2 1 4 4 1 0 5 ... |
| correct output |
|---|
| 59156 |
| user output |
|---|
| 59156 |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 100000 18 5 6 16 8 10 1 7 4 15 5 9 19... |
| correct output |
|---|
| 82598 |
| user output |
|---|
| 82598 |
Test 14
Verdict: ACCEPTED
| input |
|---|
| 100000 33 37 37 86 42 38 18 10 77 57 ... |
| correct output |
|---|
| 94897 |
| user output |
|---|
| 94897 |
