oj.uz

Submission #443942

# Submission time Handle Problem Language Result Execution time Memory
443942 2021-07-12T14:05:47 Z peijar Comparing Plants (IOI20_plants) C++17
19 / 100
 4000 ms 10216 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;

/*
 * Si h[i] < h[i+1], alors r[i+1] <= r[i]
 * Si h[i] > h[i+1] alors r[i+1] >= r[i]
 * Donc si on a r[i] != r[i+1] on peut comparer r[i] et r[i+1] !
 * r[i+1] > r[i] => h[i+1] < h[i]
 * r[i+1] < r[i] => h[i+1] > h[i]
 */

const int MAXN = 2e5;

int k;
int nbPlusGrands[MAXN], cntEq[MAXN][2];
int ordre[MAXN];
int nbDevant[MAXN];
int nbPlantes;

int disCircle(int x, int y) {
  if (x < y)
    return y - x;
  return nbPlantes - x + y;
}

void init(int _k, vector<int> r) {
  k = _k;
  nbPlantes = r.size();
  for (int iPlante = 0; iPlante < nbPlantes; ++iPlante) {
    nbPlusGrands[iPlante] = r[iPlante];
  }

  if (k == 2) {

    for (int i = nbPlantes - 1; i >= 0; --i) {
      if (i == nbPlantes - 1) {
        int x = 1;
        while (x < nbPlantes and nbPlusGrands[x - 1] == nbPlusGrands[i])
          x++;
        cntEq[i][nbPlusGrands[i]] = x;
      } else {
        cntEq[i][nbPlusGrands[i]] = 1 + cntEq[i + 1][nbPlusGrands[i]];
      }
    }
  } else if (2 * k > nbPlantes) {
    for (int i = 0; i < nbPlantes; ++i)
      nbDevant[i] = k - 1, ordre[i] = -1;
    for (int iOrdre = 0; iOrdre < nbPlantes; ++iOrdre) {
      vector<int> possibles;
      for (int iPlante = 0; iPlante < nbPlantes; ++iPlante)
        if (ordre[iPlante] == -1 and nbDevant[iPlante] == nbPlusGrands[iPlante])
          possibles.push_back(iPlante);
      while (possibles.size() > 1) {
        int x = possibles.back();
        possibles.pop_back();
        int y = possibles.back();
        possibles.pop_back();
        if (disCircle(x, y) < k)
          possibles.push_back(x);
        else
          possibles.push_back(y);
      }
      int x = possibles.back();
      ordre[x] = iOrdre;
      for (int iPlante = 0; iPlante < nbPlantes; ++iPlante)
        if (disCircle(iPlante, x) < k and ordre[iPlante] == -1)
          nbDevant[iPlante]--;
    }
  }
}

int compare_plants(int x, int y) {
  if (k == 2) {
    bool allSame1[2] = {true, true};
    bool allSame2[2] = {true, true};
    int dis1 = disCircle(x, y);
    int dis2 = disCircle(y, x);
    for (int b = 0; b < 2; ++b) {
      allSame1[b] = cntEq[x][b] >= dis1;
      allSame2[b] = cntEq[y][b] >= dis2;
    }
    /*for (int i = x; i != y; i = (i + 1 == nbPlantes ? 0 : i + 1))
      allSame1[!nbPlusGrands[i]] = false;
    for (int i = y; i != x; i = (i + 1 == nbPlantes ? 0 : i + 1))
      allSame2[!nbPlusGrands[i]] = false;*/
    if (allSame1[0] or allSame2[1])
      return 1;
    else if (allSame1[1] or allSame2[0])
      return -1;
    return 0;
  } else if (2 * k > nbPlantes) {
    return (ordre[x] < ordre[y] ? -1 : 1);
  }
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 57 ms 3176 KB Output is correct
7 Correct 67 ms 3576 KB Output is correct
8 Correct 95 ms 6596 KB Output is correct
9 Correct 91 ms 6636 KB Output is correct
10 Correct 115 ms 6608 KB Output is correct
11 Correct 93 ms 6696 KB Output is correct
12 Correct 89 ms 6648 KB Output is correct
13 Correct 88 ms 6740 KB Output is correct
14 Correct 89 ms 6632 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 332 KB Output is correct
7 Correct 234 ms 5060 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 8 ms 332 KB Output is correct
10 Correct 222 ms 5080 KB Output is correct
11 Correct 167 ms 5048 KB Output is correct
12 Correct 202 ms 5228 KB Output is correct
13 Correct 243 ms 5096 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 332 KB Output is correct
7 Correct 234 ms 5060 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 8 ms 332 KB Output is correct
10 Correct 222 ms 5080 KB Output is correct
11 Correct 167 ms 5048 KB Output is correct
12 Correct 202 ms 5228 KB Output is correct
13 Correct 243 ms 5096 KB Output is correct
14 Correct 3165 ms 5664 KB Output is correct
15 Execution timed out 4048 ms 10216 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 57 ms 3176 KB Output is correct
7 Correct 67 ms 3576 KB Output is correct
8 Correct 95 ms 6596 KB Output is correct
9 Correct 91 ms 6636 KB Output is correct
10 Correct 115 ms 6608 KB Output is correct
11 Correct 93 ms 6696 KB Output is correct
12 Correct 89 ms 6648 KB Output is correct
13 Correct 88 ms 6740 KB Output is correct
14 Correct 89 ms 6632 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 10 ms 332 KB Output is correct
21 Correct 234 ms 5060 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 8 ms 332 KB Output is correct
24 Correct 222 ms 5080 KB Output is correct
25 Correct 167 ms 5048 KB Output is correct
26 Correct 202 ms 5228 KB Output is correct
27 Correct 243 ms 5096 KB Output is correct
28 Correct 3165 ms 5664 KB Output is correct
29 Execution timed out 4048 ms 10216 KB Time limit exceeded
30 Halted 0 ms 0 KB -