oj.uz

Submission #399670

# Submission time Handle Problem Language Result Execution time Memory
399670 2021-05-06T11:41:09 Z A_D Painting Walls (APIO20_paint) C++14
12 / 100
 74 ms 22484 KB 
//#include "paint.h"
#include <bits/stdc++.h>
#define pair<int,int>
using namespace std;
const int NN=1e5+100;
bool freq[NN];
vector<int> like[NN];
vector<int> c;
vector<int> a;
map<int,int> mp3;
map<int,int> mp2;
int n,m,k;
map<int,bool> mp[NN];
bool ok(int x,int y)
{
    for(int l=0;l<m;l++){
        if(mp[(x+l)%m][c[y+l]]==0){
            return 0;
        }
    }
    return 1;
}
int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B)
    {
        a=A;
        c=C;
        n=N;
        m=M;
        k=K;
        int maxx=0;
//        cout<<5<<endl;
        for(int i=0;i<m;i++){
            for(auto x:B[i]){
                mp[i][x]=1;
                like[x].push_back(i);
            }
        }
        for(int i=0;i<k;i++){
            maxx=max(maxx,(int)like[i].size());
        }
  //      cout<<5<<endl;
        int idx=-1;
        int cnt=0;
        if(maxx<=1){

            for(int i=0;i<n;i++){
                int v=c[i];
                if(like[v].empty())return -1;
                if(like[v][0]==idx){
                    cnt++;
                }
                else{
                    cnt=1;
                    idx=like[v][0];
                }
                if(cnt>=m){
                    freq[i-m+1]=1;
                }
                idx++;
                idx%=m;
            }
        }
        else if(n<=-1){
            for(int j=0;j<=n-m;j++){
                for(auto i:like[c[j]]){
                    if(ok(i,j)){
                        freq[j]=1;
                        break;
                    }
                }
            }
        }
        else{
            for(int i=0;i<n;i++){
                mp2.clear();
                int mox=0;
                for(auto x:like[c[i]]){
                    mp2[x]=mp3[x-1]+1;
                    mox=max(mox,mp2[x]);
                }
                if(mox>=m){
                    freq[i-m+1]=1;
                }
                mp3.clear();
                mp3=mp2;
            }
        }
        int mx=0;
        int ans=0;
        int i=0;
    //    cout<<5<<endl;
        while(mx<n){
            int v=mx;
      //      cout<<mx<<endl;
            ans++;
            while(i<=mx){
                if(freq[i]){
                    v=max(v,i+m);
                }
                i++;
            }
            if(v==mx)break;
            mx=v;
        }
        if(mx<n)return -1;
        return ans;

    }
    /*
int main() {
  int N, M, K;
  assert(3 == scanf("%d %d %d", &N, &M, &K));

  std::vector<int> C(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &C[i]));
  }

  std::vector<int> A(M);
  std::vector<std::vector<int>> B(M);
  for (int i = 0; i < M; ++i) {
    assert(1 == scanf("%d", &A[i]));
    B[i].resize(A[i]);
    for (int j = 0; j < A[i]; ++j) {
      assert(1 == scanf("%d", &B[i][j]));
    }
  }

  int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
  printf("%d\n", minimum_instructions);

  return 0;
}
*/
/*
8 3 5
3 3 1 3 4 4 2 2
3 0 1 2
2 2 3
2 3 4
*/

Compilation message

paint.cpp:3:9: warning: ISO C++11 requires whitespace after the macro name
    3 | #define pair<int,int>
      |         ^~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7244 KB Output is correct
8 Correct 5 ms 7244 KB Output is correct
9 Correct 5 ms 7264 KB Output is correct
10 Correct 4 ms 7244 KB Output is correct
11 Correct 4 ms 7244 KB Output is correct
12 Correct 4 ms 7244 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 5 ms 7372 KB Output is correct
15 Correct 5 ms 7316 KB Output is correct
16 Correct 6 ms 7372 KB Output is correct
17 Correct 5 ms 7364 KB Output is correct
18 Correct 6 ms 7372 KB Output is correct
19 Correct 6 ms 7372 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 5 ms 7372 KB Output is correct
22 Correct 49 ms 15932 KB Output is correct
23 Correct 41 ms 15876 KB Output is correct
24 Correct 44 ms 15932 KB Output is correct
25 Correct 7 ms 7500 KB Output is correct
26 Correct 7 ms 7500 KB Output is correct
27 Correct 7 ms 7500 KB Output is correct
28 Correct 7 ms 7500 KB Output is correct
29 Correct 7 ms 7600 KB Output is correct
30 Correct 6 ms 7500 KB Output is correct
31 Correct 15 ms 9420 KB Output is correct
32 Correct 15 ms 9408 KB Output is correct
33 Correct 15 ms 9420 KB Output is correct
34 Correct 15 ms 9472 KB Output is correct
35 Correct 16 ms 9420 KB Output is correct
36 Correct 15 ms 9452 KB Output is correct
37 Correct 46 ms 16256 KB Output is correct
38 Correct 51 ms 16224 KB Output is correct
39 Correct 59 ms 16352 KB Output is correct
40 Correct 18 ms 8488 KB Output is correct
41 Correct 11 ms 7972 KB Output is correct
42 Correct 16 ms 8524 KB Output is correct
43 Correct 12 ms 8140 KB Output is correct
44 Correct 11 ms 8012 KB Output is correct
45 Correct 15 ms 8524 KB Output is correct
46 Correct 74 ms 20944 KB Output is correct
47 Correct 41 ms 15300 KB Output is correct
48 Correct 51 ms 17864 KB Output is correct
49 Correct 52 ms 19396 KB Output is correct
50 Correct 54 ms 19152 KB Output is correct
51 Correct 44 ms 16100 KB Output is correct
52 Correct 15 ms 8524 KB Output is correct
53 Correct 15 ms 8524 KB Output is correct
54 Correct 20 ms 8600 KB Output is correct
55 Correct 22 ms 8524 KB Output is correct
56 Correct 19 ms 8520 KB Output is correct
57 Correct 18 ms 8532 KB Output is correct
58 Correct 64 ms 22436 KB Output is correct
59 Correct 64 ms 22432 KB Output is correct
60 Correct 64 ms 22420 KB Output is correct
61 Correct 67 ms 22404 KB Output is correct
62 Correct 73 ms 22444 KB Output is correct
63 Correct 74 ms 22484 KB Output is correct
64 Correct 68 ms 21600 KB Output is correct
65 Correct 74 ms 21568 KB Output is correct
66 Correct 67 ms 21500 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7244 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 5 ms 7244 KB Output is correct
5 Correct 5 ms 7244 KB Output is correct
6 Correct 4 ms 7244 KB Output is correct
7 Correct 4 ms 7244 KB Output is correct
8 Correct 5 ms 7244 KB Output is correct
9 Correct 5 ms 7264 KB Output is correct
10 Correct 4 ms 7244 KB Output is correct
11 Correct 4 ms 7244 KB Output is correct
12 Correct 4 ms 7244 KB Output is correct
13 Correct 5 ms 7372 KB Output is correct
14 Correct 5 ms 7372 KB Output is correct
15 Correct 5 ms 7316 KB Output is correct
16 Correct 6 ms 7372 KB Output is correct
17 Correct 5 ms 7364 KB Output is correct
18 Correct 6 ms 7372 KB Output is correct
19 Correct 6 ms 7372 KB Output is correct
20 Correct 5 ms 7372 KB Output is correct
21 Correct 5 ms 7372 KB Output is correct
22 Incorrect 5 ms 7244 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 7244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 7244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 7244 KB Output isn't correct
2 Halted 0 ms 0 KB -