— Dark mode

Aalto Competitive Programming 2026 - wk4 - Mon

Targeted advertising

  • Start: 2026-09-21 16:20:00
  • End: 2026-09-21 17:50:00
Submission details
Task:Targeted advertising
Sender:aalto26dm_038
Submission time:2026-09-21 16:57:57 +0300
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.01 sdetails
#3ACCEPTED0.01 sdetails
#4ACCEPTED0.01 sdetails
#5ACCEPTED0.01 sdetails
#6ACCEPTED0.01 sdetails
#7ACCEPTED0.01 sdetails
#8ACCEPTED0.01 sdetails
#9ACCEPTED0.01 sdetails
#10ACCEPTED0.01 sdetails
#11ACCEPTED0.01 sdetails
#12ACCEPTED0.01 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.01 sdetails
#15ACCEPTED0.01 sdetails
#16ACCEPTED0.01 sdetails
#17ACCEPTED0.01 sdetails
#18ACCEPTED0.01 sdetails
#19ACCEPTED0.01 sdetails
#20ACCEPTED0.01 sdetails
#21ACCEPTED0.01 sdetails
#22ACCEPTED0.01 sdetails
#23ACCEPTED0.01 sdetails
#24ACCEPTED0.01 sdetails
#25ACCEPTED0.01 sdetails
#26ACCEPTED0.01 sdetails
#27ACCEPTED0.01 sdetails
#28ACCEPTED0.01 sdetails
#29ACCEPTED0.01 sdetails
#30ACCEPTED0.01 sdetails
#31ACCEPTED0.01 sdetails
#32ACCEPTED0.01 sdetails
#33ACCEPTED0.01 sdetails
#34ACCEPTED0.01 sdetails
#35ACCEPTED0.01 sdetails
#36ACCEPTED0.01 sdetails
#37ACCEPTED0.01 sdetails
#38ACCEPTED0.01 sdetails
#39ACCEPTED0.01 sdetails
#40ACCEPTED0.01 sdetails
#41ACCEPTED0.01 sdetails
#42ACCEPTED0.01 sdetails
#43ACCEPTED0.01 sdetails
#44ACCEPTED0.01 sdetails
#45ACCEPTED0.01 sdetails
#46ACCEPTED0.01 sdetails
#47ACCEPTED0.01 sdetails
#48ACCEPTED0.01 sdetails
#49ACCEPTED0.01 sdetails
#50ACCEPTED0.01 sdetails
#51ACCEPTED0.01 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.01 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.01 sdetails
#58ACCEPTED0.01 sdetails
#59ACCEPTED0.01 sdetails
#60ACCEPTED0.07 sdetails
#61ACCEPTED0.07 sdetails
#62ACCEPTED0.07 sdetails
#63ACCEPTED0.06 sdetails
#64ACCEPTED0.07 sdetails
#65ACCEPTED0.06 sdetails
#66ACCEPTED0.07 sdetails
#67ACCEPTED0.07 sdetails
#68ACCEPTED0.06 sdetails
#69ACCEPTED0.07 sdetails
#70ACCEPTED0.05 sdetails

Code

#include<bits/stdc++.h>
//#include<unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define FI first
#define SE second
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef map<int,int> mpi;
typedef set<int> sti;
typedef vector<pii> vii;
typedef map<pii,int> mpii;
typedef set<pii> stii;
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int power(int x, int y) { return (!y ? 1 : power(x, y / 2) * power(x, y / 2) * (y % 2 ? x : 1)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
int fastMax(int x, int y) { return (((y-x)>>(32-1))&(x^y))^y; }
int fastMin(int x, int y) { return (((y-x)>>(32-1))&(x^y))^x; }
const int MAXN=2e5+30,MAX_LOG=30,MOD=1e9+7,INF=1e9;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int n, q;
// int s[MAXN*4+1],lazy[4*MAXN+1],rq[MAXN*4+1];
// int a[MAXN],ans[MAXN];
// void build(int id=1,int l=0,int r=n){
//     if(r-l<2){
//         s[id]=a[l];
//         rq[id]=a[l];
//         return;
//     }
//     int mid=(l+r)/2;
//     build(id*2,l,mid);build(id*2+1,mid,r);
//     s[id]=s[id*2]+s[id*2+1];
//     rq[id]=min(rq[id*2],rq[id*2+1]);
// }
// void upd(int id,int l,int r,int x){
//     lazy[id]+=x;
//     rq[id]+=x;
//     s[id]+=(r-l)*x;
// }
// void shift(int id,int l,int r){
//     int mid=(l+r)/2;
//     upd(id*2,l,mid,lazy[id]);
//     upd(id*2+1,mid,r,lazy[id]);
//     lazy[id]=0;
// }
// void add(int x,int y,int v,int id=1,int l=0,int r=n){
//     if(x>=r || l>=y)return;
//     if(x<=l && r<=y){
//         upd(id,l,r,v);
//         return;
//     }
//     shift(id,l,r);
//     int mid=(l+r)/2;
//     add(x,y,v,id*2,l,mid);
//     add(x,y,v,id*2+1,mid,r);
//     s[id]=s[id*2]+s[id*2+1];
//     rq[id]=min(rq[id*2],rq[id*2+1]);
// }
// int sum(int x,int y,int id=1,int l=0,int r=n){
//     if(x>=r || l>=y)return 0;
//     if(x<=l && r<=y)return s[id];
//     shift(id,l,r);
//     int mid=(l+r)/2;
//     return sum(x,y,id*2,l,mid)+sum(x,y,id*2+1,mid,r);
// }
// int rmq(int x,int y,int id=1,int l=0,int r=n){
//     if(x>=r || l>=y)return INF*INF;
//     if(x<=l && r<=y)return rq[id];
//     shift(id,l,r);
//     int mid=(l+r)/2;
//     return min(rmq(x,y,id*2,l,mid),rmq(x,y,id*2+1,mid,r));
// }

int a[MAXN];
vector<int> positions[MAXN];
int MAIN(){
    int k;
    cin>>n>>k>>q;
    for (int i = 0; i < n; i++){
        cin>>a[i];
        positions[a[i]].push_back(i + 1);
    }

    for (int i = 0; i < q; i++){
        int left, right, interest;
        cin>>left>>right>>interest;
        vector<int>::iterator first = lower_bound(positions[interest].begin(), positions[interest].end(), left);
        vector<int>::iterator last = upper_bound(positions[interest].begin(), positions[interest].end(), right);
        cout<<(last - first)<<endl;
    }

    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    //cin>>t;
    while(t--)MAIN();
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1 1 1
1 
1 1 1
view save

correct output
1
view save

user output
1
view save

Test 2

Verdict: ACCEPTED

input
1 1 2
1 
1 1 1
1 1 1
view save

correct output
1
1
view save

user output
1
1
view save

Test 3

Verdict: ACCEPTED

input
2 1 2
1 1 
2 2 1
1 2 1
view save

correct output
1
2
view save

user output
1
2
view save

Test 4

Verdict: ACCEPTED

input
2 2 5
2 1 
1 1 2
1 1 2
1 2 2
...
view save

correct output
1
1
1
1
1
view save

user output
1
1
1
1
1
view save

Test 5

Verdict: ACCEPTED

input
3 2 4
1 1 1 
1 3 1
2 3 2
2 2 2
...
view save

correct output
3
0
0
0
view save

user output
3
0
0
0
view save

Test 6

Verdict: ACCEPTED

input
3 3 8
2 3 1 
2 3 2
1 2 2
2 3 1
...
view save

correct output
0
1
1
1
1
...
view save

user output
0
1
1
1
1
...
view save

Test 7

Verdict: ACCEPTED

input
4 2 9
2 2 1 2 
2 2 2
2 4 1
2 3 1
...
view save

correct output
1
1
1
1
2
...
view save

user output
1
1
1
1
2
...
view save

Test 8

Verdict: ACCEPTED

input
4 3 11
3 3 2 2 
3 3 2
2 4 1
3 3 3
...
view save

correct output
1
0
0
1
1
...
view save

user output
1
0
0
1
1
...
view save

Test 9

Verdict: ACCEPTED

input
4 4 8
4 1 4 2 
3 4 2
2 2 1
1 4 2
...
view save

correct output
1
1
1
1
1
...
view save

user output
1
1
1
1
1
...
view save

Test 10

Verdict: ACCEPTED

input
5 3 11
3 3 2 3 2 
3 5 2
2 4 2
2 5 1
...
view save

correct output
2
1
0
2
1
...
view save

user output
2
1
0
2
1
...
view save

Test 11

Verdict: ACCEPTED

input
5 5 9
4 5 1 1 2 
1 5 2
1 2 1
2 2 4
...
view save

correct output
1
0
0
0
1
...
view save

user output
1
0
0
0
1
...
view save

Test 12

Verdict: ACCEPTED

input
5 1 9
1 1 1 1 1 
3 3 1
1 2 1
4 4 1
...
view save

correct output
1
2
1
2
1
...
view save

user output
1
2
1
2
1
...
view save

Test 13

Verdict: ACCEPTED

input
5 1 11
1 1 1 1 1 
3 5 1
1 5 1
1 2 1
...
view save

correct output
3
5
2
1
4
...
view save

user output
3
5
2
1
4
...
view save

Test 14

Verdict: ACCEPTED

input
5 5 15
3 1 5 5 4 
4 4 3
1 2 5
1 2 4
...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 15

Verdict: ACCEPTED

input
5 1 7
1 1 1 1 1 
3 5 1
2 4 1
2 3 1
...
view save

correct output
3
3
2
4
5
...
view save

user output
3
3
2
4
5
...
view save

Test 16

Verdict: ACCEPTED

input
5 5 14
2 2 5 1 1 
1 2 5
1 3 3
3 4 3
...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 17

Verdict: ACCEPTED

input
5 2 5
2 1 1 2 2 
3 5 1
2 3 2
1 1 1
...
view save

correct output
1
0
0
1
1
view save

user output
1
0
0
1
1
view save

Test 18

Verdict: ACCEPTED

input
5 1 14
1 1 1 1 1 
2 5 1
1 4 1
3 4 1
...
view save

correct output
4
4
2
3
3
...
view save

user output
4
4
2
3
3
...
view save

Test 19

Verdict: ACCEPTED

input
5 2 5
2 1 1 1 1 
1 2 1
2 5 1
1 2 1
...
view save

correct output
1
4
1
1
2
view save

user output
1
4
1
1
2
view save

Test 20

Verdict: ACCEPTED

input
10 6 21
5 6 4 6 4 6 3 4 4 3 
3 5 6
1 10 2
4 5 5
...
view save

correct output
1
0
0
1
2
...
view save

user output
1
0
0
1
2
...
view save

Test 21

Verdict: ACCEPTED

input
10 10 18
8 10 1 2 4 10 2 3 1 4 
2 4 4
4 7 10
6 9 5
...
view save

correct output
0
1
0
0
0
...
view save

user output
0
1
0
0
0
...
view save

Test 22

Verdict: ACCEPTED

input
10 2 19
1 2 2 2 1 1 1 1 1 1 
3 7 2
2 3 1
3 7 2
...
view save

correct output
2
0
2
0
3
...
view save

user output
2
0
2
0
3
...
view save

Test 23

Verdict: ACCEPTED

input
10 1 21
1 1 1 1 1 1 1 1 1 1 
1 2 1
1 3 1
5 7 1
...
view save

correct output
2
3
3
4
5
...
view save

user output
2
3
3
4
5
...
view save

Test 24

Verdict: ACCEPTED

input
10 10 30
6 2 10 9 8 7 7 6 3 2 
3 10 1
3 7 10
5 7 8
...
view save

correct output
0
1
1
1
0
...
view save

user output
0
1
1
1
0
...
view save

Test 25

Verdict: ACCEPTED

input
10 1 14
1 1 1 1 1 1 1 1 1 1 
4 8 1
3 5 1
2 9 1
...
view save

correct output
5
3
8
2
3
...
view save

user output
5
3
8
2
3
...
view save

Test 26

Verdict: ACCEPTED

input
10 10 28
4 3 9 1 1 4 2 10 6 1 
6 7 5
4 6 5
7 9 5
...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 27

Verdict: ACCEPTED

input
10 3 11
3 1 2 3 3 2 3 1 2 1 
1 6 1
3 5 1
5 6 3
...
view save

correct output
1
0
1
0
0
...
view save

user output
1
0
1
0
0
...
view save

Test 28

Verdict: ACCEPTED

input
10 1 28
1 1 1 1 1 1 1 1 1 1 
5 8 1
5 6 1
5 10 1
...
view save

correct output
4
2
6
5
4
...
view save

user output
4
2
6
5
4
...
view save

Test 29

Verdict: ACCEPTED

input
10 4 10
3 2 2 1 1 2 1 1 1 4 
2 5 1
1 2 2
4 5 1
...
view save

correct output
2
1
2
1
2
...
view save

user output
2
1
2
1
2
...
view save

Test 30

Verdict: ACCEPTED

input
100 60 210
43 51 37 52 33 51 26 38 39 24 ...
view save

correct output
0
1
0
1
0
...
view save

user output
0
1
0
1
0
...
view save

Test 31

Verdict: ACCEPTED

input
100 100 183
73 94 1 13 31 100 15 24 10 40 ...
view save

correct output
0
1
1
0
0
...
view save

user output
0
1
1
0
0
...
view save

Test 32

Verdict: ACCEPTED

input
100 19 187
1 18 11 19 9 10 8 7 7 3 4 14 1...
view save

correct output
5
0
0
3
4
...
view save

user output
5
0
0
3
4
...
view save

Test 33

Verdict: ACCEPTED

input
100 8 210
6 7 3 1 5 5 8 4 8 1 2 1 2 2 1 ...
view save

correct output
0
9
0
3
4
...
view save

user output
0
9
0
3
4
...
view save

Test 34

Verdict: ACCEPTED

input
100 91 294
50 16 89 78 66 56 64 55 20 13 ...
view save

correct output
1
0
0
0
0
...
view save

user output
1
0
0
0
0
...
view save

Test 35

Verdict: ACCEPTED

input
100 6 144
6 5 2 3 6 6 3 1 4 3 5 3 4 3 2 ...
view save

correct output
7
15
10
15
5
...
view save

user output
7
15
10
15
5
...
view save

Test 36

Verdict: ACCEPTED

input
100 95 279
32 20 79 7 4 36 11 94 57 10 51...
view save

correct output
0
2
1
1
0
...
view save

user output
0
2
1
1
0
...
view save

Test 37

Verdict: ACCEPTED

input
100 23 115
18 8 11 23 17 11 23 8 13 7 12 ...
view save

correct output
1
0
0
4
0
...
view save

user output
1
0
0
4
0
...
view save

Test 38

Verdict: ACCEPTED

input
100 2 275
2 1 2 1 2 2 1 1 1 2 1 2 1 1 2 ...
view save

correct output
26
30
13
11
16
...
view save

user output
26
30
13
11
16
...
view save

Test 39

Verdict: ACCEPTED

input
100 37 102
19 19 19 1 5 12 6 1 9 33 16 6 ...
view save

correct output
1
1
3
2
1
...
view save

user output
1
1
3
2
1
...
view save

Test 40

Verdict: ACCEPTED

input
200 119 420
86 101 72 103 65 101 51 75 77 ...
view save

correct output
1
0
0
0
0
...
view save

user output
1
0
0
0
0
...
view save

Test 41

Verdict: ACCEPTED

input
200 200 367
145 187 1 26 61 200 30 48 19 8...
view save

correct output
0
0
2
0
0
...
view save

user output
0
0
2
0
0
...
view save

Test 42

Verdict: ACCEPTED

input
200 38 374
1 36 21 37 17 19 16 13 13 6 8 ...
view save

correct output
1
1
3
3
0
...
view save

user output
1
1
3
3
0
...
view save

Test 43

Verdict: ACCEPTED

input
200 15 420
11 13 5 2 8 9 14 7 14 1 2 1 4 ...
view save

correct output
6
0
11
2
3
...
view save

user output
6
0
11
2
3
...
view save

Test 44

Verdict: ACCEPTED

input
200 181 587
100 32 177 155 130 111 127 109...
view save

correct output
0
1
2
1
0
...
view save

user output
0
1
2
1
0
...
view save

Test 45

Verdict: ACCEPTED

input
200 12 289
11 10 3 5 12 12 6 2 8 5 10 5 7...
view save

correct output
2
13
0
3
6
...
view save

user output
2
13
0
3
6
...
view save

Test 46

Verdict: ACCEPTED

input
200 190 558
64 40 157 13 8 71 21 188 114 1...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 47

Verdict: ACCEPTED

input
200 46 230
36 15 21 45 34 21 45 15 25 13 ...
view save

correct output
0
0
0
4
1
...
view save

user output
0
0
0
4
1
...
view save

Test 48

Verdict: ACCEPTED

input
200 3 550
3 1 3 2 2 3 1 2 1 2 2 3 2 2 2 ...
view save

correct output
38
59
26
36
10
...
view save

user output
38
59
26
36
10
...
view save

Test 49

Verdict: ACCEPTED

input
200 73 204
37 37 37 1 10 24 11 1 16 65 31...
view save

correct output
2
3
0
4
0
...
view save

user output
2
3
0
4
0
...
view save

Test 50

Verdict: ACCEPTED

input
1000 593 2098
425 501 358 509 324 503 252 37...
view save

correct output
1
0
0
0
4
...
view save

user output
1
0
0
0
4
...
view save

Test 51

Verdict: ACCEPTED

input
1000 998 1834
719 931 1 128 302 998 147 236 ...
view save

correct output
0
0
0
0
0
...
view save

user output
0
0
0
0
0
...
view save

Test 52

Verdict: ACCEPTED

input
1000 186 1872
5 174 103 177 81 91 79 60 62 2...
view save

correct output
0
0
1
3
0
...
view save

user output
0
0
1
3
0
...
view save

Test 53

Verdict: ACCEPTED

input
1000 71 2102
51 60 21 9 37 41 64 32 64 2 9 ...
view save

correct output
1
1
3
15
4
...
view save

user output
1
1
3
15
4
...
view save

Test 54

Verdict: ACCEPTED

input
1000 901 2935
494 156 877 771 645 549 629 53...
view save

correct output
0
0
1
1
0
...
view save

user output
0
0
1
1
0
...
view save

Test 55

Verdict: ACCEPTED

input
1000 56 1444
49 47 12 21 52 55 28 6 35 23 4...
view save

correct output
11
11
1
0
2
...
view save

user output
11
11
1
0
2
...
view save

Test 56

Verdict: ACCEPTED

input
1000 948 2786
315 199 779 61 40 351 103 934 ...
view save

correct output
1
0
1
0
0
...
view save

user output
1
0
1
0
0
...
view save

Test 57

Verdict: ACCEPTED

input
1000 228 1152
178 73 100 224 165 104 223 71 ...
view save

correct output
1
1
2
3
0
...
view save

user output
1
1
2
3
0
...
view save

Test 58

Verdict: ACCEPTED

input
1000 12 2747
12 3 11 5 7 10 3 6 1 8 6 10 5 ...
view save

correct output
0
25
15
7
47
...
view save

user output
0
25
15
7
47
...
view save

Test 59

Verdict: ACCEPTED

input
1000 365 1020
184 183 181 3 49 116 52 5 80 3...
view save

correct output
1
0
0
1
0
...
view save

user output
1
0
0
1
0
...
view save

Test 60

Verdict: ACCEPTED

input
100000 59286 100000
42402 50054 35736 50865 32305 ...
view save

correct output
1
0
3
1
1
...
view save

user output
1
0
3
1
1
...
view save

Test 61

Verdict: ACCEPTED

input
100000 99721 100000
71833 92998 12 12777 30150 996...
view save

correct output
1
0
0
0
0
...
view save

user output
1
0
0
0
0
...
view save

Test 62

Verdict: ACCEPTED

input
100000 18509 100000
480 17242 10174 17542 8058 897...
view save

correct output
0
2
1
1
1
...
view save

user output
0
2
1
1
1
...
view save

Test 63

Verdict: ACCEPTED

input
100000 7073 100000
5009 5941 2058 859 3614 4027 6...
view save

correct output
6
9
3
2
0
...
view save

user output
6
9
3
2
0
...
view save

Test 64

Verdict: ACCEPTED

input
100000 90064 100000
49287 15554 87606 77063 64381 ...
view save

correct output
1
2
0
0
0
...
view save

user output
1
2
0
0
0
...
view save

Test 65

Verdict: ACCEPTED

input
100000 5519 100000
4806 4589 1141 2008 5070 5406 ...
view save

correct output
10
1
9
14
0
...
view save

user output
10
1
9
14
0
...
view save

Test 66

Verdict: ACCEPTED

input
100000 94750 100000
31456 19842 77813 6089 3951 35...
view save

correct output
0
1
0
1
0
...
view save

user output
0
1
0
1
0
...
view save

Test 67

Verdict: ACCEPTED

input
100000 22735 100000
17732 7252 9968 22240 16449 10...
view save

correct output
0
4
0
1
1
...
view save

user output
0
4
0
1
1
...
view save

Test 68

Verdict: ACCEPTED

input
100000 1112 100000
1078 267 967 420 591 908 259 4...
view save

correct output
7
13
73
12
23
...
view save

user output
7
13
73
12
23
...
view save

Test 69

Verdict: ACCEPTED

input
100000 36447 100000
18292 18192 18070 275 4878 115...
view save

correct output
0
1
1
2
2
...
view save

user output
0
1
1
2
2
...
view save

Test 70

Verdict: ACCEPTED

input
100000 100000 100000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view save

correct output
100000
100000
100000
100000
100000
...
view save

user output
100000
100000
100000
100000
100000
...
view save

Tasks

A Xor sumB Forest densityC Moon landingD Targeted advertising

Submissions (aalto26dm_038)

2026-09-21 16:57:57 2026-09-21 16:57:34