oj.uz

Submission #395556

# Submission time Handle Problem Language Result Execution time Memory
395556 2021-04-28T13:54:12 Z Sugardorj Painting Walls (APIO20_paint) C++14
0 / 100
 1 ms 308 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
int  i,j,s,t;
int c[234567],a[234567],l=12345678,r,tt,k,y,z,n,m,x;
pair<int,pair<int,int>>p[234567];
int minimumInstructions(int n, int m, int K, vector<int> C,vector<int> A,       vector<vector<int>> B){
    for (i = 0; i <m; i ++){
        for (auto u:B[i]){
            a[u]=i;
        }
    }
    s= 0;
    if (n%m==0){
        while (s<n){
            x = a[C[s]];
            for (i = s; i<s+m; i ++){
                if (a[C[i]]!=(x+i-s)%m)
                    return -1;
            }
            s+=m;
        }
        return n/m;
    }
    else {
        x = a[C[0]];
        for (i = 0; i <n; i ++){
            if (a[C[i]]!=(x+i)%m)
                return -1;
        }
        return n/m+1;
    }
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -