oj.uz

Submission #399661

# Submission time Handle Problem Language Result Execution time Memory
399661 2021-05-06T11:18:31 Z A_D Painting Walls (APIO20_paint) C++14
12 / 100
 72 ms 23752 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;
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;
//        cout<<5<<endl;
        for(int i=0;i<m;i++){
            for(auto x:B[i]){
                mp[i][x]=1;
                like[x].push_back(i);
            }
        }
  //      cout<<5<<endl;
        int idx=-1;
        int cnt=0;
        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]=cnt;
            }
            idx++;
            idx%=m;
        }
        /*
        for(int j=0;j<=n-m;j+=m){
            for(auto i:like[c[j]]){
                if(ok(i,j)){
                    freq[j]=1;
                    break;
                }
            }
        }
        */
        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 4 ms 7244 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 4 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 5 ms 7244 KB Output is correct
8 Correct 5 ms 7344 KB Output is correct
9 Correct 6 ms 7244 KB Output is correct
10 Correct 5 ms 7244 KB Output is correct
11 Correct 4 ms 7244 KB Output is correct
12 Correct 5 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 7372 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct
17 Correct 5 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 5 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 41 ms 15976 KB Output is correct
23 Correct 40 ms 15856 KB Output is correct
24 Correct 43 ms 15940 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 7500 KB Output is correct
30 Correct 7 ms 7504 KB Output is correct
31 Correct 15 ms 9420 KB Output is correct
32 Correct 15 ms 9420 KB Output is correct
33 Correct 16 ms 9420 KB Output is correct
34 Correct 15 ms 9420 KB Output is correct
35 Correct 15 ms 9548 KB Output is correct
36 Correct 15 ms 9436 KB Output is correct
37 Correct 45 ms 16276 KB Output is correct
38 Correct 45 ms 16244 KB Output is correct
39 Correct 46 ms 16288 KB Output is correct
40 Correct 15 ms 8396 KB Output is correct
41 Correct 11 ms 7964 KB Output is correct
42 Correct 17 ms 8564 KB Output is correct
43 Correct 12 ms 8128 KB Output is correct
44 Correct 11 ms 8104 KB Output is correct
45 Correct 16 ms 8524 KB Output is correct
46 Correct 64 ms 21004 KB Output is correct
47 Correct 37 ms 15944 KB Output is correct
48 Correct 43 ms 18632 KB Output is correct
49 Correct 55 ms 20244 KB Output is correct
50 Correct 55 ms 20024 KB Output is correct
51 Correct 44 ms 16964 KB Output is correct
52 Correct 16 ms 8780 KB Output is correct
53 Correct 17 ms 8716 KB Output is correct
54 Correct 17 ms 8716 KB Output is correct
55 Correct 17 ms 8772 KB Output is correct
56 Correct 17 ms 8716 KB Output is correct
57 Correct 16 ms 8824 KB Output is correct
58 Correct 66 ms 23604 KB Output is correct
59 Correct 65 ms 23716 KB Output is correct
60 Correct 71 ms 23752 KB Output is correct
61 Correct 66 ms 23656 KB Output is correct
62 Correct 67 ms 23612 KB Output is correct
63 Correct 66 ms 23620 KB Output is correct
64 Correct 67 ms 22852 KB Output is correct
65 Correct 70 ms 22840 KB Output is correct
66 Correct 72 ms 22752 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7244 KB Output is correct
3 Correct 5 ms 7244 KB Output is correct
4 Correct 4 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 5 ms 7244 KB Output is correct
8 Correct 5 ms 7344 KB Output is correct
9 Correct 6 ms 7244 KB Output is correct
10 Correct 5 ms 7244 KB Output is correct
11 Correct 4 ms 7244 KB Output is correct
12 Correct 5 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 7372 KB Output is correct
16 Correct 5 ms 7372 KB Output is correct
17 Correct 5 ms 7372 KB Output is correct
18 Correct 5 ms 7372 KB Output is correct
19 Correct 5 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 4 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 4 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 4 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 4 ms 7244 KB Output isn't correct
2 Halted 0 ms 0 KB -