Submission #1173615

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1173615	2025-03-25 15:13:05	PlayVoltz	Painting Walls (APIO20_paint)	C++20	100 / 100	446 ms	13148 KiB

paint

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
bool can[100005];
int m, cc[50005], freq[50005];
vector<int> c, in[100005];
void add(int i){
  for (auto a:in[c[i]])--freq[cc[(i-a%m+m)%m]], ++cc[(i-a%m+m)%m], ++freq[cc[(i-a%m+m)%m]];
}
void del(int i){
  for (auto a:in[c[i]])--freq[cc[(i-a%m+m)%m]], --cc[(i-a%m+m)%m], ++freq[cc[(i-a%m+m)%m]];
}
int minimumInstructions(int n, int M, int k, vector<int> C, vector<int> a, vector<vector<int> > b){
  m=M;
  c=C;
  for (int i=0; i<m; ++i)for (auto num:b[i])in[num].pb(i);
  freq[0]=m;
  for (int i=0; i<m; ++i)add(i);
  can[0]=!!freq[m];
  for (int i=m; i<n; ++i)del(i-m), add(i), can[i-m+1]=!!freq[m];
  int ans=0, p=-1, i=0;
  while (1){
    int mx=-1;
    while (p<i)if (can[++p])mx=p+m;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 15 / 15
• Subtask 3: 13 / 13
• Subtask 4: 23 / 23
• Subtask 5: 37 / 37