oj.uz

Submission #1041236

# Submission time Handle Problem Language Result Execution time Memory
1041236 2024-08-01T18:41:22 Z DeathIsAwe Gondola (IOI14_gondola) C++14
100 / 100
 22 ms 6252 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

int valid(int n, int inputSeq[]) {
  unordered_set<int> dupcheck;
  for (int i=0;i<n;i++) {
    dupcheck.insert(inputSeq[i]);
  }
  if (dupcheck.size() < n) {
    return 0;
  }
  int start = -1, temp;
  for (int i=0;i<n;i++) {
    if (inputSeq[i] <= n) {
      start = i; 
      break;
    }
  }
  if (start == -1) {
    return 1;
  } else {
    for (int i=start+1;i<n;i++) {
      if (inputSeq[i] <= n) {
        temp = (inputSeq[i] - inputSeq[start] + n) % n;
        if (temp != i - start) {
          return 0;
        }
        start = i;
      }
    }
  }
  return 1;
}





int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  int temp;
  for (int i=0;i<n;i++) {
    if (gondolaSeq[i] <= n) {
      temp = gondolaSeq[i] - i;
      break;
    }
  }
  vector<pair<int,int>> bruh;
  for (int i=0;i<n;i++) {
    if (gondolaSeq[i] > n) {
      bruh.push_back(make_pair(gondolaSeq[i], i));
    }
  }
  sort(bruh.begin(), bruh.end());
  int tracker = 0;
  for (pair<int,int> i: bruh) {
    replacementSeq[tracker++] = (i.second + temp + n) % n;
    if (replacementSeq[tracker - 1] == 0) {
      replacementSeq[tracker - 1] = n;
    }
    while (tracker + n < i.first) {
      replacementSeq[tracker] = tracker + n;
      tracker++;
    }
  }
  return tracker;
}





ll powfunc(ll a, ll b) {
  if (b == 0) {
    return 1;
  }
  vector<bool> binvec;
  while (b > 0) {
    if (b % 2 == 0) {
      binvec.push_back(false);
    } else {
      binvec.push_back(true);
    }
    b /= 2;
  }
  binvec.pop_back();
  ll val = a;
  reverse(binvec.begin(), binvec.end());
  for (bool i: binvec) {
    val *= val;
    val %= 1000000009;
    if (i) {
      val *= a;
      val %= 1000000009;
    }
  }
  return val;
}


int countReplacement(int n, int inputSeq[]) {
  if (valid(n, inputSeq) == 0) {
    return 0;
  }
  vector<int> overs;
  for (int i=0;i<n;i++) {
    if (inputSeq[i] > n) {
      overs.push_back(inputSeq[i]);
    }
  }
  sort(overs.begin(),overs.end());
  int siz = overs.size(), below = n;
  ll ans = 1;
  bool bruh = false;
  if (siz == n) {
    bruh = true;
  }
  for (int i=0;i<siz;i++) {
    ans *= powfunc(siz - i, overs[i] - below - 1);
    ans %= 1000000009;
  
    if (bruh) {
      bruh = false;
      ans *= (ll)(siz - i);
      ans %= 1000000009;
    }
    below = overs[i];
  }
  return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:11:23: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   11 |   if (dupcheck.size() < n) {
      |       ~~~~~~~~~~~~~~~~^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:58:43: warning: 'temp' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |     replacementSeq[tracker++] = (i.second + temp + n) % n;
      |                                  ~~~~~~~~~^~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1964 KB Output is correct
7 Correct 9 ms 3436 KB Output is correct
8 Correct 7 ms 3436 KB Output is correct
9 Correct 2 ms 1692 KB Output is correct
10 Correct 8 ms 3972 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 1976 KB Output is correct
7 Correct 10 ms 3252 KB Output is correct
8 Correct 7 ms 3436 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 8 ms 3948 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 1908 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 14 ms 5432 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 372 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 9 ms 1260 KB Output is correct
14 Correct 4 ms 600 KB Output is correct
15 Correct 10 ms 2384 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 17 ms 3692 KB Output is correct
10 Correct 12 ms 3180 KB Output is correct
11 Correct 4 ms 1676 KB Output is correct
12 Correct 5 ms 1672 KB Output is correct
13 Correct 1 ms 600 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 14 ms 3692 KB Output is correct
10 Correct 12 ms 3132 KB Output is correct
11 Correct 4 ms 1628 KB Output is correct
12 Correct 6 ms 1720 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 19 ms 3836 KB Output is correct
15 Correct 22 ms 6252 KB Output is correct
16 Correct 3 ms 1368 KB Output is correct
17 Correct 14 ms 3792 KB Output is correct
18 Correct 8 ms 2232 KB Output is correct