Submission #1106233

#TimeUsernameProblemLanguageResultExecution timeMemory
1106233vladiliusPainting Walls (APIO20_paint)C++17
63 / 100
549 ms524288 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; #define pb push_back #define ff first #define ss second const int inf = 3e5; int minimumInstructions(int n, int m, int k, vector<int> x, vector<int> A, vector<vector<int>> B){ vector<int> d[k]; for (int i = 0; i < m; i++){ for (int j: B[i]){ d[j].pb(i); } } vector<int> T[n]; for (int i = 0; i < n; i++){ for (int j: d[x[i]]){ T[i].pb(j); T[i].pb(j + m); } for (int j = 0; j < T[i].size(); j++) T[i][j] -= i; } vector<int> V[inf]; for (int i = 0; i < n; i++){ for (int j: T[i]){ V[j + n].pb(i); } } vector<bool> gd(n); for (int y = 0; y < inf; y++){ int i = 0; while (i < V[y].size()){ int j = i; while (j + 1 < V[y].size() && (V[y][j] + 1) == V[y][j + 1]) j++; for (int t = V[y][i]; t <= V[y][j] - m + 1; t++) gd[t] = 1; i = j + 1; } } int mx = -1, t = -1, out = 0; for (int i = 0; i < n; i++){ if (gd[i]) t = max(t, i); if (i == (mx + 1)){ if (t == -1) return -1; mx = t + m - 1; t = -1; out++; } } return out; }

Compilation message (stderr)

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int j = 0; j < T[i].size(); j++) T[i][j] -= i;
      |                         ~~^~~~~~~~~~~~~
paint.cpp:37:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         while (i < V[y].size()){
      |                ~~^~~~~~~~~~~~~
paint.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |             while (j + 1 < V[y].size() && (V[y][j] + 1) == V[y][j + 1]) j++;
      |                    ~~~~~~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...