Task: | Alitaulukot |
Sender: | pvartiovaara |
Submission time: | 2020-10-09 20:53:49 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 11 |
#2 | ACCEPTED | 26 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#6 | ACCEPTED | 0.03 s | 2, 3 | details |
#7 | ACCEPTED | 0.01 s | 2, 3 | details |
#8 | ACCEPTED | 0.01 s | 2, 3 | details |
#9 | ACCEPTED | 0.03 s | 2, 3 | details |
#10 | ACCEPTED | 0.03 s | 2, 3 | details |
#11 | TIME LIMIT EXCEEDED | -- | 3 | details |
#12 | ACCEPTED | 0.03 s | 3 | details |
#13 | ACCEPTED | 0.03 s | 3 | details |
#14 | TIME LIMIT EXCEEDED | -- | 3 | details |
#15 | TIME LIMIT EXCEEDED | -- | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'void compute()': input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int b = 0; b < line.size()-1; b++) { ~~^~~~~~~~~~~~~~~ input/code.cpp:32:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(numf == layer.size()) { break; } ~~~~~^~~~~~~~~~~~~~~
Code
#include <algorithm>#include <bits/stdc++.h>#define MK(x, y) std::make_pair(x, y)int n, k, res = 0;std::vector<std::pair<int,int> > line;// calculate the treevoid compute() {int size = line.size();for (int a = 0; a < size; a++) {std::vector<std::pair<int,int> > layer;if (line.size() < 2 ) {if (line[0].first > -1 || std::max(line.data()->first, line.data()->second) - std::min(line.data()->first, line.data()->second) <= k) {break;}}int numf = 0;for (int b = 0; b < line.size()-1; b++) {int max = std::max(line[b].first, line[b+1].first);int min = std::min(line[b].second, line[b+1].second);if (min == -1 || max - min > k) {layer.push_back(MK(-1, -1));numf++;} else {layer.push_back(MK(max, min));res++;}}if(numf == layer.size()) { break; }line = layer;}}int main() {std::cin>> n >> k;res = n;if (n < 2) {std::cout<< n << std::endl;return 0;}int prev;std::cin>> prev;bool prevbool = false;for (int i = 0; i < n-1; i++) {int in;std::cin>> in;int max = std::max(prev, in), min = std::min(prev, in);if (max - min > k) {// the value wasn't rightif (prevbool) {compute();}line.clear();line.shrink_to_fit();prevbool = false;} else {// the value was rightline.push_back(MK(max, min));prevbool = true;res++;}prev = in;}if (line.size() > 0) {compute();}std::cout<< res << std::endl;return 0;}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5050 |
user output |
---|
5050 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 2 5 5 2 4 3 5 3 4 3 2 3 4 5 4 4 ... |
correct output |
---|
317 |
user output |
---|
317 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 10 71 60 61 96 25 10 10 9 84 85 1... |
correct output |
---|
119 |
user output |
---|
119 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 990000000 111122929 961821360 578238211 ... |
correct output |
---|
4006 |
user output |
---|
4006 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
100 1000000000 553190572 453407680 667300705 ... |
correct output |
---|
5050 |
user output |
---|
5050 |
Test 6
Group: 2, 3
Verdict: ACCEPTED
input |
---|
2000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
2001000 |
user output |
---|
2001000 |
Test 7
Group: 2, 3
Verdict: ACCEPTED
input |
---|
2000 2 4 4 1 4 2 3 1 2 1 3 5 2 2 4 4 ... |
correct output |
---|
6340 |
user output |
---|
6340 |
Test 8
Group: 2, 3
Verdict: ACCEPTED
input |
---|
2000 10 65 88 33 88 41 10 17 38 22 3 8... |
correct output |
---|
2413 |
user output |
---|
2413 |
Test 9
Group: 2, 3
Verdict: ACCEPTED
input |
---|
2000 999000000 746120950 772769620 721488968 ... |
correct output |
---|
1287776 |
user output |
---|
1287776 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
input |
---|
2000 1000000000 621947980 510355354 756705418 ... |
correct output |
---|
2001000 |
user output |
---|
2001000 |
Test 11
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5000050000 |
user output |
---|
(empty) |
Test 12
Group: 3
Verdict: ACCEPTED
input |
---|
100000 2 3 3 1 3 3 1 1 5 1 2 5 4 1 3 1 ... |
correct output |
---|
317066 |
user output |
---|
317066 |
Test 13
Group: 3
Verdict: ACCEPTED
input |
---|
100000 10 10 3 6 3 43 60 5 48 15 27 86 4... |
correct output |
---|
123292 |
user output |
---|
123292 |
Test 14
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 999990000 460235639 963048588 47270983 3... |
correct output |
---|
4946886742 |
user output |
---|
(empty) |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1000000000 885457070 18257718 927615960 3... |
correct output |
---|
5000050000 |
user output |
---|
(empty) |
Test 16
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
correct output |
---|
3750075000 |
user output |
---|
(empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 50000 100000 99999 99998 99997 99996... |
correct output |
---|
3750075000 |
user output |
---|
(empty) |