oj.uz

Submission #967158

# Submission time Handle Problem Language Result Execution time Memory
967158 2024-04-21T11:13:13 Z VMaksimoski008 Gondola (IOI14_gondola) C++17
55 / 100
 19 ms 4904 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int valid(int n, int inputSeq[]) {
    int ans = 1;
    int cnt = 0;
    set<int> s;

    int big = 0;
    for(int i=0; i<n; i++) {
      if(inputSeq[i] > n) big++;
    }

    vector<int> v(n);
    int pos = -1;
    for(int i=0; i<n; i++) {
      if(inputSeq[i] <= n) {
        pos = i;
        v[i] = inputSeq[i];
        break;
      }
    }

    for(int i=pos+1; i<n; i++) {
      v[i] = v[i-1] + 1;
      //if(v[i] > n) v[i] -= n;
    }

    for(int i=pos-1; i>=0; i--) {
      v[i] = v[i+1] - 1;
      //if(v[i] <= 0) 
    }

    for(int i=0; i<n; i++) {
      if(v[i] > n) v[i] -= n;
      else if(v[i] <= 0) v[i] += n;
    }

    for(int i=0; i<n; i++) {
      if(inputSeq[i] > n) continue;
      if(inputSeq[i] != v[i]) return 0;
    }

    for(int i=0; i<n; i++) s.insert(inputSeq[i]);
    if(s.size() < n) return 0;

    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  int cnt = 0, big = 0, arr[n];
  for(int i=0; i<n; i++) arr[i] = gondolaSeq[i];

  for(int i=0; i<n; i++) big += (arr[i] > n);

  if(big == n) {
    vector<pair<int, int> > v;
    for(int i=0; i<n; i++) v.push_back({ arr[i], i + 1 });
    sort(v.begin(), v.end());

    int curr = n + 1;
    for(int i=0; i<n; i++) {
      int a = v[i].second, b = v[i].first;
      replacementSeq[cnt++] = a;
      while(curr != b) {
        replacementSeq[cnt++] = curr++;
      }
      curr++;
    }
  } else {
    vector<int> v(n);
    int pos = -1;
    for(int i=0; i<n; i++) {
      if(arr[i] <= n) {
        pos = i;
        v[i] = arr[i];
        break;
      }
    }

    for(int i=pos+1; i<n; i++) v[i] = v[i-1] + 1;
    for(int i=pos-1; i>=0; i--) v[i] = v[i+1] - 1;

    for(int i=0; i<n; i++) {
      if(v[i] > n) v[i] -= n;
      else if(v[i] <= 0) v[i] += n;
    }

    vector<pair<int, int> > ord;
    for(int i=0; i<n; i++) 
      if(arr[i] > n) ord.push_back({ arr[i], v[i] });
    sort(ord.begin(), ord.end());

    int curr = n + 1;
    for(auto &[b, a] : ord) {
      replacementSeq[cnt++] = a;
      while(curr != b) replacementSeq[cnt++] = curr++;
      curr++;
    }
  }

  return cnt;
}

int countReplacement(int n, int inputSeq[]) {
  if(!valid(n, inputSeq)) return 0;
  const int mod = 1e9 + 9;
  ll ans = 1;

  vector<int> v;
  for(int i=0; i<n; i++)
    if(inputSeq[i] > n) v.push_back(inputSeq[i]);
  sort(v.begin(), v.end());

  int mx = v.back();
  int sz = v.size();
  for(int i=n+1; i<=mx; i++) {
    int p = lower_bound(v.begin(), v.end(), i) - v.begin();
    if(v[p] == i) continue;
    ans = (ans * (sz - p)) % mod;
  }

  return (int)ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:48:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   48 |     if(s.size() < n) return 0;
      |        ~~~~~~~~~^~~
gondola.cpp:8:9: warning: unused variable 'ans' [-Wunused-variable]
    8 |     int ans = 1;
      |         ^~~
gondola.cpp:9:9: warning: unused variable 'cnt' [-Wunused-variable]
    9 |     int cnt = 0;
      |         ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 600 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 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 10 ms 2356 KB Output is correct
7 Correct 7 ms 984 KB Output is correct
8 Correct 16 ms 4188 KB Output is correct
9 Correct 5 ms 1624 KB Output is correct
10 Correct 19 ms 4852 KB Output is correct

Subtask #3
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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2396 KB Output is correct
7 Correct 7 ms 1112 KB Output is correct
8 Correct 15 ms 4184 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct
10 Correct 19 ms 4904 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 8 ms 1112 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 544 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

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 348 KB Output is correct
5 Correct 0 ms 344 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 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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 7 ms 1372 KB Output is correct
12 Correct 8 ms 1372 KB Output is correct
13 Correct 12 ms 1496 KB Output is correct
14 Correct 6 ms 1116 KB Output is correct
15 Correct 18 ms 2640 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 444 KB Output is correct
3 Runtime error 1 ms 348 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #8
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 Runtime error 1 ms 344 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Runtime error 1 ms 348 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #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 Runtime error 1 ms 348 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -