| Task: | Key cutting |
| Sender: | undefined reference to 'Päivölä' |
| Submission time: | 2024-11-16 16:11:33 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | WRONG ANSWER |
| 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 | WRONG ANSWER | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | TIME LIMIT EXCEEDED | -- | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | TIME LIMIT EXCEEDED | -- | details |
| #12 | TIME LIMIT EXCEEDED | -- | details |
| #13 | WRONG ANSWER | 0.87 s | details |
| #14 | WRONG ANSWER | 0.35 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef uint64_t u64;
int main() {
u64 n,p=0;
cin >> n;
u64 holes[n];
for (u64 i = 0; i < n; i++) cin >> holes[i];
u64 cuts = 0;
while (p<n)
{
u64 current = holes[p];
for (u64 i = p; holes[i] >= current && i < n; i++)
{
holes[i] -= current;
}
if (holes[p] < current) {
cuts++;
}
p++;
}
cout << cuts;
}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: WRONG ANSWER
| input |
|---|
| 100 36 5 10 37 94 59 20 31 64 2 58... |
| correct output |
|---|
| 99 |
| user output |
|---|
| 97 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100 228768416 32415139 952687252 6... |
| correct output |
|---|
| 100 |
| user output |
|---|
| 100 |
Test 9
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 10
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 1 1 1 0 0 1 0 0 0 0 1 0 1 0 0 ... |
| correct output |
|---|
| 24965 |
| user output |
|---|
| (empty) |
Test 11
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 2 1 2 2 2 2 2 1 1 0 1 1 0 1 1 ... |
| correct output |
|---|
| 38968 |
| user output |
|---|
| (empty) |
Test 12
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 4 4 5 4 4 5 0 2 2 1 4 4 1 0 5 ... |
| correct output |
|---|
| 59156 |
| user output |
|---|
| (empty) |
Test 13
Verdict: WRONG ANSWER
| input |
|---|
| 100000 18 5 6 16 8 10 1 7 4 15 5 9 19... |
| correct output |
|---|
| 82598 |
| user output |
|---|
| 78345 |
Test 14
Verdict: WRONG ANSWER
| input |
|---|
| 100000 33 37 37 86 42 38 18 10 77 57 ... |
| correct output |
|---|
| 94897 |
| user output |
|---|
| 91568 |
