CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:pulkitsja
Submission time:2017-01-19 21:44:29 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1details
#20.04 s1details
#30.03 s1details
#40.03 s1details
#50.04 s1details
#60.04 s2details
#70.04 s2details
#80.04 s2details
#90.04 s2details
#100.05 s2details
#110.22 s3details
#120.18 s3details
#130.20 s3details
#140.23 s3details
#150.19 s3details

Compiler report

input/code.cpp: In function 'int main(int, const char**)':
input/code.cpp:21:13: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     sd2(n,k);
             ^
input/code.cpp:24:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       sd(arr[i]);
                 ^

Code

#include<bits/stdc++.h>
#define pb push_back
#define inf 1000500000
#define mod 1000000007
#define linf 1000000001000000000ll
#define mp make_pair
#define sd(a) scanf("%d",&a)
#define sd2(a,b) scanf("%d%d",&a,&b)
#define nax 200010
#define flu fflush(stdout)
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int arr[nax];
multiset< int >sett;
multiset< int >there;
int main(int argc, char const *argv[])
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int n,k;
    sd2(n,k);
    for (int i = 0; i < n; ++i)
    {
      sd(arr[i]);
      sett.insert(i);
    }
    for (int i = 0; i < k; ++i)
    {
      there.insert(arr[i]);
      if(sett.find(arr[i])!=sett.end())
      sett.erase(sett.find(arr[i]));
    }
    printf("%d ",*sett.begin());
    for(int i=k;i<n;i++)
    {
      there.erase(there.find(arr[i-k]));
      if(there.find(arr[i-k])==there.end())
        sett.insert(arr[i-k]);
      there.insert(arr[i]);
      if(there.find(arr[i])!=there.end())
        sett.erase(arr[i]);
      printf("%d ",*sett.begin());
    }
    return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
10 20
4 5
6 4
5 1
5 9
...

correct output
11

user output

Test 2

Group: 1

Verdict:

input
10 10
7 3
5 2
9 7
1 5
...

correct output
5

user output

Test 3

Group: 1

Verdict:

input
10 5
5 7
3 8
5 8
3 7
...

correct output
4

user output
0 0 0 0 0 0 

Test 4

Group: 1

Verdict:

input
10 4
9 1
6 8
7 1
5 7

correct output
3

user output
0 0 0 0 0 2 1 

Test 5

Group: 1

Verdict:

input
10 2
10 6
2 1

correct output
2

user output
0 0 0 2 1 1 1 1 1 

Test 6

Group: 2

Verdict:

input
100 200
24 40
25 6
36 93
92 90
...

correct output
97

user output

Test 7

Group: 2

Verdict:

input
100 100
98 37
91 37
60 92
46 27
...

correct output
60

user output

Test 8

Group: 2

Verdict:

input
100 50
74 95
53 72
69 85
14 13
...

correct output
34

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

Test 9

Group: 2

Verdict:

input
100 40
28 76
10 81
13 52
46 83
...

correct output
29

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

Test 10

Group: 2

Verdict:

input
100 20
27 35
72 92
56 4
64 80
...

correct output
18

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

Test 11

Group: 3

Verdict:

input
100000 200000
89244 59358
22943 56710
63331 89437
56581 38400
...

correct output
102510

user output

Test 12

Group: 3

Verdict:

input
100000 100000
21701 85599
61542 21474
38081 29362
46316 64038
...

correct output
60593

user output

Test 13

Group: 3

Verdict:

input
100000 50000
86469 4833
16351 35505
59315 33011
95464 16985
...

correct output
35933

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

Test 14

Group: 3

Verdict:

input
100000 40000
5392 23534
63204 45619
74330 25925
59678 88427
...

correct output
30074

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

Test 15

Group: 3

Verdict:

input
100000 20000
80156 16531
71753 77661
7028 33389
17168 646
...

correct output
16882

user output
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...