Submission #1041143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041143		DeathIsAwe	Gondola (IOI14_gondola)	C++14	20 / 100	13 ms	5764 KiB

gondola

#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[]) {
  return -2;
}





int countReplacement(int n, int inputSeq[]) {
  return -3;
}

Compilation message (stderr)

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) {
      |       ~~~~~~~~~~~~~~~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10