Submission #230316

# Submission time Handle Problem Language Result Execution time Memory
230316 2020-05-09T14:15:22 Z DanerZein Gondola (IOI14_gondola) C++14
20 / 100
38 ms 4608 KB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
  set<int>s;
  int x=inputSeq[0];
  s.insert(inputSeq[0]);
  for(int i=1;i<n;i++){
    s.insert(inputSeq[i]);
    if(x==n){
      if(inputSeq[i]==1){
	x=1;
      }
      else return 0;
    }
    else{
      if(x==inputSeq[i]-1){
	x=inputSeq[i];
      }
      else return 0;
    }
  }
  if(s.size()!=n) return 0;
  return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int id=-1,idaux=-1;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]==1){
      id=i;
      break;
    }
    if(gondolaSeq[i]==2){
      idaux=i;
      break;
    }
  }
  int na=1;
  if(id==-1){
    idaux=id;
    na=2;
  }
  int l=0,a=0;;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]>n){
      replacementSeq[a]=na;
      a++;
      l++;
    }
    id++;
    na++;
    if(id==n) id=0;
    if(na>n) na=1;
  }
  return l;
}

//----------------------

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:24:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.size()!=n) return 0;
      ~~~~~~~~^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:32:13: warning: variable 'idaux' set but not used [-Wunused-but-set-variable]
   int id=-1,idaux=-1;
             ^~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 17 ms 2176 KB Output is correct
7 Correct 17 ms 640 KB Output is correct
8 Correct 28 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 30 ms 4608 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 288 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 16 ms 2304 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 29 ms 3968 KB Output is correct
9 Correct 16 ms 1536 KB Output is correct
10 Correct 38 ms 4608 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 17 ms 640 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -