Submission #319433

#	Time	Username	Problem	Language	Result	Execution time	Memory
319433		Vimmer	Painting Walls (APIO20_paint)	C++14	0 / 100	1 ms	492 KiB

paint

#include <bits/stdc++.h>
//#include "paint.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define N 100100
#define F first
#define S second
#define M ll(1e9 + 7)
#define endl '\n'
#define all(x) x.begin(), x.end()
#define PB push_back
#define sz(x) ll(x.size())
#define pw(x) (1ll << x)
#define pwr(x) ((1ll << x) - 1)
#define _ << " " <<
#define pri(s) cout << s << endl

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef short int si;
typedef unsigned long long ull;

//typedef tree<int, null_type, less <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int> > b)
{
    int who[k];

    for (int i = 0; i < k; i++) who[i] = -1;

    for (int i = 0; i < m; i++) who[b[i][0]] = i;

    for (int i = 0; i < n; i++) {a[i] = who[a[i]]; if (a[i] == -1) return -1;}

    bool mk[n];

    memset(mk, 0, sizeof mk);

    for (int i = 0; i < n; i++)
      if (a[i] == 0)
      {
          int len = 0;

          bool bad = 0;

          int cur = i;

          while (len < m)
          {
            if (a[cur] != len) {bad = 1; break;}

            len++;

            cur++;

            cur %= n;
          }

          if (!bad)
          {
              len = 0;

              cur = i;

              while (len < m)
              {
                mk[cur] = 1;

                len++;

                cur++;

                cur %= n;
              }
          }

          bad = 0;

          len = 0;

          cur = i;

          while (len < m)
          {
              if (a[cur] != len) {bad = 1; break;}

              len++;

              cur--;

              cur += n;

              cur %= n;
          }

          if (!bad)
          {
              len = 0;

              cur = i;

              while (len < m)
              {
                  mk[cur] = 1;

                  len++;

                  cur--;

                  cur += n;

                  cur %= n;
              }
          }
      }

    for (int i = 0; i < n; i++) if (!mk[i]) return -1;

    return n / m;
}

//int main()
//{
//    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
//
//}

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