제출 #402090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
402090		victoriad	곤돌라 (IOI14_gondola)	C++14	0 / 100	1 ms	204 KiB

gondola

#include "gondola.h"
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;


int valid(int n,int inputSeq[]){
  bool p=true;
  int d=1e9,f=1e9;
  for(int i=0;i<n;i++){
    if(inputSeq[i]<=n){
      d=inputSeq[i]-i;
      f=n-inputSeq[i];
      break;
    }
  }
  int s=sizeof(inputSeq)/sizeof(inputSeq[0]);
  if(s!=n)p=false;
  if(d<1e9 && f<1e9){
  if(p){
  for(int i=0;i<=f;i++){
    if(inputSeq[i]<=n && inputSeq[i]!=i+d){
      p=false;
      break;
    }
  }
  if(p){
    for(int i=f+1;i<n;i++){
      if(inputSeq[i]<=n && inputSeq[i]!=i-f){
        p=false;
        break;
      }
    }
  }
  }
  }
  if(p)return 1;
  return 0;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{ int x=0,y;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]<=n){
      x=gondolaSeq[i]-i;
      y=i+n-gondolaSeq[i];
    }
  }
  int l=0;
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]>n){
      l++;
      if(i<=y){
        replacementSeq[gondolaSeq[i]-n-1]=i+x;
      }
      else{
        replacementSeq[gondolaSeq[i]-n-1]=i-y;
      }
    }
  }
  
  return l;
}
//----------------------

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

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:18:16: warning: 'sizeof' on array function parameter 'inputSeq' will return size of 'int*' [-Wsizeof-array-argument]
   18 |   int s=sizeof(inputSeq)/sizeof(inputSeq[0]);
      |               ~^~~~~~~~~
gondola.cpp:8:21: note: declared here
    8 | int valid(int n,int inputSeq[]){
      |                 ~~~~^~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:56:7: warning: 'y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   56 |       if(i<=y){
      |       ^~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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