oj.uz

Submission #788935

# Submission time Handle Problem Language Result Execution time Memory
788935 2023-07-20T17:49:49 Z Boas Stray Cat (JOI20_stray) C++17
91 / 100
 269 ms 26612 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

namespace
{
  int a, m;
  bool debug = false;
}

using namespace std;

typedef vector<vector<int>> vvi;
typedef vector<int> vi;
typedef pair<int, int> pii;

void setDebug(bool v)
{
  debug = v;
}

vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V)
{
  a = A;
  m = M;
  vvi adj(N);
  vector<int> graad(N);
  map<pii, int> edgeIndex;
  for (int i = 0; i < m; i++)
  {
    int a = U[i], b = V[i];
    adj[a].push_back(b);
    adj[b].push_back(a);
    graad[a]++;
    graad[b]++;
    edgeIndex[{a, b}] = i;
    edgeIndex[{b, a}] = i;
  }
  vector<int> X(M, -1);
  queue<tuple<int, int, vector<int>>> q;
  q.push({0, A - 1, {}});
  vector<vi> lijnen;
  while (!q.empty())
  {
    auto [i, mark, lijn] = q.front();
    q.pop();
    bool isEnd = true;
    for (int j : adj[i])
    {
      int edgeInx = edgeIndex[{i, j}];
      if (X[edgeInx] != -1)
        continue;
      isEnd = false;
      if (debug)
        cerr << "Road from " << i << " to " << j << " gets mark " << mark << endl;
      X[edgeInx] = mark;
      if (a == 2 && graad[i] != 2)
      {
        if (lijn.size() >= 4)
        {
          lijnen.push_back(lijn);
        }
        lijn.clear();
      }
      if (a != 2 || (graad[i] != 2 && graad[j] != 2))
      {
        q.push({j, (mark - 1 + a) % a, lijn});
      }
      else
      {
        vi newLijn(lijn);
        newLijn.push_back(edgeInx);
        q.push({j, (mark - 1 + a) % a, newLijn});
      }
    }
    if (A == 2 && isEnd && lijn.size() >= 4)
      lijnen.push_back(lijn);
  }
  vi pattern = {0, 0, 1, 0, 1, 1};
  for (const auto &lijn : lijnen)
  {
    if (lijn.size() < 4)
      continue;
    int d = 0;
    while (X[lijn[0]] != pattern[(d) % 6] || X[lijn.back()] != pattern[(d + lijn.size() - 1) % 6])
    {
      d++;
      if (d > 1000)
      {
        break;
      }
    }
    for (uint32_t i = 0; i < lijn.size(); i++)
    {
      int mark = pattern[(i + d) % 6];
      if (debug)
        cerr << "Lijn van " << U[lijn[i]] << " naar " << V[lijn[i]] << " krijgt mark " << mark << endl;
      X[lijn[i]] = mark;
    }
  }
  return X;
}

#include "Catherine.h"
#include <vector>
#include <map>
#include <iostream>
using namespace std;

typedef vector<int> vi;
namespace
{
  vi prevMarks;
  int A, B;
  int prevMark = -1;
} // namespace

void Init(int A, int B)
{
  ::A = A;
  ::B = B;
  prevMarks.clear();
  prevMark = -1;
}

int calculateMove(vi &y)
{
  vector<int> leastOccurences = {};
  int least = (1 << 30);
  map<int, int> occurences;
  if (A == 2 && prevMark != -1)
  {
    y[prevMark]++;
  }

  for (int j = 0; j < A; ++j)
  {
    if (y[j] > 0)
    {
      if (y[j] < least)
      {
        least = y[j];
        leastOccurences = {j};
      }
      else if (y[j] == least)
      {
        leastOccurences.push_back(j);
      }
      occurences[j] = y[j];
    }
  }
  if (A > 2)
  {
    if (occurences.find(A - 1) != occurences.end() && occurences.find(0) != occurences.end())
    {
      return 0;
    }
    int max = 0;
    for (const auto &[j, c] : occurences)
    {
      max = std::max(j, max);
    }
    return max;
  }

  if (leastOccurences.size() == 0)
  {
    throw;
    return -1;
  }

  if (leastOccurences.size() == 1)
  {
    if (leastOccurences[0] == prevMark && y[leastOccurences[0]] == 1)
    {
      prevMarks.clear();
      return -1;
    }
    return leastOccurences[0];
  }
  if (leastOccurences.size() == 2)
  {
    // extra code for long straight lines with A = 2
    for (int i : leastOccurences)
    {
      if (i != prevMark) // when prevMark == -1, the 0 size is chosen
        return i;
    }
  }
  throw;
}

int Move(vi y)
{
  int sum = 0;
  for (int v : y)
    sum += v;
  int mark = calculateMove(y);
  if (prevMark == -1)
  {
    for (int i = 0; i < y.size(); i++)
    {
      if ((i != mark && y[i] > 0) || y[i] > 1)
      {
        prevMarks.push_back(i);
      }
    }
  }
  if (A == 2 && sum == 1)
  {
    prevMarks.push_back(mark);
    int s = prevMarks.size();
    if (s > 3)
    {
      const vector<vi> turnAroundMarks = {
          {0, 0, 1, 0},
          {0, 1, 0, 1},
          {1, 0, 1, 1},
          {1, 1, 0, 0}};
      for (const auto &seq : turnAroundMarks)
      {
        for (int d = 0; d <= (int)turnAroundMarks.size() - 4; d++)
        {
          bool allEqual = true;
          for (int i = 0; i < 4; i++)
          {
            if (seq[i] != prevMarks[i + d])
            {
              allEqual = false;
              break;
            }
          }
          if (allEqual)
          {
            prevMarks.clear();
            return prevMark = -1;
          }
        }
      }
    }
  }
  else
    prevMarks.clear();
  return prevMark = mark;
}

Compilation message

Catherine.cpp: In function 'int Move(vi)':
Catherine.cpp:98:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for (int i = 0; i < y.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 17848 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 41 ms 17908 KB Output is correct
4 Correct 65 ms 18996 KB Output is correct
5 Correct 52 ms 19080 KB Output is correct
6 Correct 45 ms 17704 KB Output is correct
7 Correct 51 ms 17728 KB Output is correct
8 Correct 55 ms 18424 KB Output is correct
9 Correct 49 ms 18448 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 17848 KB Output is correct
2 Correct 0 ms 512 KB Output is correct
3 Correct 41 ms 17908 KB Output is correct
4 Correct 65 ms 18996 KB Output is correct
5 Correct 52 ms 19080 KB Output is correct
6 Correct 45 ms 17704 KB Output is correct
7 Correct 51 ms 17728 KB Output is correct
8 Correct 55 ms 18424 KB Output is correct
9 Correct 49 ms 18448 KB Output is correct
10 Correct 45 ms 15884 KB Output is correct
11 Correct 45 ms 15884 KB Output is correct
12 Correct 49 ms 15716 KB Output is correct
13 Correct 45 ms 15680 KB Output is correct
14 Correct 44 ms 15952 KB Output is correct
15 Correct 50 ms 16232 KB Output is correct
16 Correct 49 ms 18644 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 15464 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 46 ms 15320 KB Output is correct
4 Correct 50 ms 16964 KB Output is correct
5 Correct 51 ms 16900 KB Output is correct
6 Correct 66 ms 15784 KB Output is correct
7 Correct 43 ms 15468 KB Output is correct
8 Correct 48 ms 16184 KB Output is correct
9 Correct 55 ms 16052 KB Output is correct
10 Correct 45 ms 15852 KB Output is correct
11 Correct 48 ms 15860 KB Output is correct
12 Correct 50 ms 15812 KB Output is correct
13 Correct 49 ms 15868 KB Output is correct
14 Correct 51 ms 16212 KB Output is correct
15 Correct 48 ms 16140 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 15464 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 46 ms 15320 KB Output is correct
4 Correct 50 ms 16964 KB Output is correct
5 Correct 51 ms 16900 KB Output is correct
6 Correct 66 ms 15784 KB Output is correct
7 Correct 43 ms 15468 KB Output is correct
8 Correct 48 ms 16184 KB Output is correct
9 Correct 55 ms 16052 KB Output is correct
10 Correct 45 ms 15852 KB Output is correct
11 Correct 48 ms 15860 KB Output is correct
12 Correct 50 ms 15812 KB Output is correct
13 Correct 49 ms 15868 KB Output is correct
14 Correct 51 ms 16212 KB Output is correct
15 Correct 48 ms 16140 KB Output is correct
16 Correct 47 ms 14112 KB Output is correct
17 Correct 46 ms 14172 KB Output is correct
18 Correct 50 ms 13808 KB Output is correct
19 Correct 46 ms 13796 KB Output is correct
20 Correct 50 ms 14360 KB Output is correct
21 Correct 47 ms 14160 KB Output is correct
22 Correct 50 ms 16392 KB Output is correct
23 Correct 50 ms 14060 KB Output is correct
24 Correct 50 ms 13984 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 900 KB Output is correct
2 Correct 1 ms 544 KB Output is correct
3 Correct 3 ms 900 KB Output is correct
4 Correct 2 ms 1028 KB Output is correct
5 Correct 2 ms 1028 KB Output is correct
6 Correct 2 ms 1036 KB Output is correct
7 Correct 2 ms 1036 KB Output is correct
8 Correct 3 ms 1076 KB Output is correct
9 Correct 2 ms 1036 KB Output is correct
10 Correct 2 ms 1036 KB Output is correct
11 Correct 2 ms 1028 KB Output is correct
12 Correct 2 ms 900 KB Output is correct
13 Correct 2 ms 900 KB Output is correct
14 Correct 2 ms 1036 KB Output is correct
15 Correct 2 ms 1036 KB Output is correct
16 Correct 2 ms 908 KB Output is correct
17 Correct 2 ms 864 KB Output is correct
18 Correct 2 ms 900 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 908 KB Output is correct
21 Correct 2 ms 872 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 2 ms 912 KB Output is correct
24 Correct 2 ms 908 KB Output is correct
25 Correct 2 ms 908 KB Output is correct
26 Correct 2 ms 904 KB Output is correct
27 Correct 2 ms 900 KB Output is correct
28 Correct 2 ms 900 KB Output is correct

Subtask #6
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 13820 KB Output is correct
2 Correct 54 ms 14408 KB Output is correct
3 Correct 1 ms 516 KB Output is correct
4 Correct 39 ms 13996 KB Output is correct
5 Correct 215 ms 15348 KB Output is correct
6 Correct 269 ms 15248 KB Output is correct
7 Correct 214 ms 14340 KB Output is correct
8 Correct 207 ms 14352 KB Output is correct
9 Correct 236 ms 15564 KB Output is correct
10 Correct 229 ms 26612 KB Output is correct
11 Correct 258 ms 15352 KB Output is correct
12 Correct 223 ms 15368 KB Output is correct
13 Correct 215 ms 15364 KB Output is correct
14 Correct 227 ms 15360 KB Output is correct
15 Correct 225 ms 15528 KB Output is correct
16 Correct 216 ms 15348 KB Output is correct
17 Correct 214 ms 15084 KB Output is correct
18 Correct 236 ms 14988 KB Output is correct
19 Correct 215 ms 14964 KB Output is correct
20 Correct 242 ms 15020 KB Output is correct
21 Correct 216 ms 14972 KB Output is correct
22 Correct 223 ms 14972 KB Output is correct
23 Correct 44 ms 13772 KB Output is correct
24 Correct 51 ms 13748 KB Output is correct
25 Correct 47 ms 13944 KB Output is correct
26 Correct 62 ms 14024 KB Output is correct
27 Correct 53 ms 14224 KB Output is correct
28 Correct 48 ms 14440 KB Output is correct
29 Correct 47 ms 14448 KB Output is correct
30 Correct 64 ms 14412 KB Output is correct
31 Correct 43 ms 13744 KB Output is correct
32 Correct 44 ms 13824 KB Output is correct
33 Correct 52 ms 14048 KB Output is correct
34 Correct 44 ms 13928 KB Output is correct
35 Correct 46 ms 14396 KB Output is correct
36 Correct 45 ms 14264 KB Output is correct
37 Correct 47 ms 14392 KB Output is correct
38 Correct 48 ms 14336 KB Output is correct
39 Correct 53 ms 14196 KB Output is correct
40 Correct 46 ms 14324 KB Output is correct
41 Correct 55 ms 14688 KB Output is correct
42 Correct 54 ms 14804 KB Output is correct
43 Correct 69 ms 14664 KB Output is correct
44 Correct 62 ms 14772 KB Output is correct
45 Correct 53 ms 14820 KB Output is correct
46 Correct 56 ms 14832 KB Output is correct
47 Correct 47 ms 14316 KB Output is correct
48 Correct 48 ms 14188 KB Output is correct
49 Correct 51 ms 14120 KB Output is correct
50 Correct 51 ms 14368 KB Output is correct
51 Correct 48 ms 14008 KB Output is correct
52 Correct 43 ms 14064 KB Output is correct
53 Correct 43 ms 14108 KB Output is correct
54 Correct 44 ms 13956 KB Output is correct
55 Correct 41 ms 13992 KB Output is correct
56 Correct 44 ms 14032 KB Output is correct
57 Correct 63 ms 13928 KB Output is correct
58 Correct 44 ms 13992 KB Output is correct
59 Correct 41 ms 14100 KB Output is correct
60 Correct 54 ms 14112 KB Output is correct

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 13872 KB Output is correct
2 Correct 52 ms 13928 KB Output is correct
3 Correct 1 ms 576 KB Output is correct
4 Correct 43 ms 14108 KB Output is correct
5 Correct 214 ms 15352 KB Output is correct
6 Correct 232 ms 15472 KB Output is correct
7 Incorrect 211 ms 14452 KB Wrong Answer [6]
8 Halted 0 ms 0 KB -