Task: | Alitaulukot |
Sender: | CursedTomb |
Submission time: | 2020-10-09 16:50:05 +0300 |
Language: | C++ (C++17) |
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.01 s | 2, 3 | details |
#7 | ACCEPTED | 0.01 s | 2, 3 | details |
#8 | ACCEPTED | 0.01 s | 2, 3 | details |
#9 | ACCEPTED | 0.01 s | 2, 3 | details |
#10 | ACCEPTED | 0.01 s | 2, 3 | details |
#11 | ACCEPTED | 0.02 s | 3 | details |
#12 | ACCEPTED | 0.02 s | 3 | details |
#13 | ACCEPTED | 0.03 s | 3 | details |
#14 | ACCEPTED | 0.05 s | 3 | details |
#15 | ACCEPTED | 0.05 s | 3 | details |
#16 | TIME LIMIT EXCEEDED | -- | 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 3 | details |
Compiler report
input/code.cpp: In function 'std::pair<int, int> minMax(int, int)': input/code.cpp:25:12: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized] return ret; ^~~ input/code.cpp:25:12: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized] input/code.cpp: In function 'int main()': input/code.cpp:55:45: warning: 'd' may be used uninitialized in this function [-Wmaybe-uninitialized] if(m.second < m.first){a=m.second+1;} ~^~~~~~~~~~~ input/code.cpp:56:29: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized] else {a = m.first+1;} ~~^~~~~~~~~~~
Code
#include <bits/stdc++.h> using namespace std; vector<int> v; int x,y,suurin,pienin,l; pair<int,int> minMax(int a,int b) { long long mini = 1e10; long long maxi = 0; int c,d; for(int i = a;i<=b;i++) { if(v[i]<mini) { mini = v[i]; c = i; } if(v[i]>maxi) { maxi = v[i]; d = i; } } pair<int,int> ret = make_pair(c,d); return ret; } int main() { cin >> x >> y; v.resize(x); for(int i =0;i<x;i++) cin >> v[i]; int a=l=0; suurin = v[0]; pienin = v[0]; long long summa = 0; for(int i = 0;i<2*x;i++) { suurin = max(suurin,v[l]); pienin = min(pienin, v[l]); if(suurin-pienin<=y) { summa+=l-a+1; l+=1; } else { //cout << *max_element(v.begin()+a,v.begin()+l+1)<< "h" << "\n"; while(1) { pair<int,int>m = minMax(a,l); //cout << m.first << " " << m.second << "\n"; if(v[m.second]-v[m.first]>y) { if(m.second < m.first){a=m.second+1;} else {a = m.first+1;} continue; } suurin = v[m.second]; pienin = v[m.first]; break; } } //cout << a<< " " << l << " " << pienin << " " << suurin << " " << "\n"; if(l==x) break; } cout << summa << "\n"; //system("pause"); 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: ACCEPTED
input |
---|
100000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5000050000 |
user output |
---|
5000050000 |
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: ACCEPTED
input |
---|
100000 999990000 460235639 963048588 47270983 3... |
correct output |
---|
4946886742 |
user output |
---|
4946886742 |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
100000 1000000000 885457070 18257718 927615960 3... |
correct output |
---|
5000050000 |
user output |
---|
5000050000 |
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) |