제출 #435798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
435798		chirathnirodha	곤돌라 (IOI14_gondola)	C++17	55 / 100	37 ms	2228 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define P push
typedef long long ll;

int valid(int n, int inputSeq[]){
  int arr[n];
  for(int i=0;i<n;i++){
    if(inputSeq[i]<=n){
      int pp=inputSeq[i]-i-1+n;
      for(int j=0;j<n;j++){
        arr[(pp+j)%n]=inputSeq[j];
      }
      break;
    }
  }
  for(int i=0;i<n;i++)if(arr[i]<=n && arr[i]-1!=i)return 0;
  sort(arr,arr+n);
  for(int i=1;i<n;i++)if(arr[i]==arr[i-1])return 0;
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  int arr[n];
  for(int i=0;i<n;i++)arr[i]=gondolaSeq[i];
  for(int i=0;i<n;i++){
    if(gondolaSeq[i]<=n){
      int pp=gondolaSeq[i]-i-1+n;
      for(int j=0;j<n;j++){
        arr[(pp+j)%n]=gondolaSeq[j];
      }
      break;
    }
  }
  int cur=n+1;
  int pos=0;
  vector<pair<int,int> > v;
  for(int i=0;i<n;i++)v.PB(MP(arr[i],i+1));
  sort(v.begin(),v.end());
  for(int i=0;i<n;i++){
    if(v[i].F<=n)continue;
    replacementSeq[pos]=v[i].S;pos++;
    for(cur;cur<v[i].F;cur++){replacementSeq[pos]=cur;pos++;}
    cur++;
  }
  return pos;
}

//----------------------
bool visited[200];
int ans=0;
void dfs(int n,int x,vector<pair<int,int> > v,int cur){
  cout<<x<<endl;
  if(x==v[cur].S){
    if(cur==v.size()-1){
      for(int i=0;i<n;i++)if(!visited[i])return;
      ans++;
      return;
    }
    visited[v[cur+1].F]=true;
    dfs(n,v[cur+1].F,v,cur+1);
    visited[v[cur+1].F]=false;
  }
  else{
    for(int i=x+1;i<=v[cur].S;i++){
      bool ok=true;
      for(int j=0;j<v.size();j++)if(i==v[j].S)ok=false;
      if(!ok || visited[i])continue;
      visited[i]=true;
      dfs(n,i,v,cur);
      visited[i]=false;
    }
  }
}
int countReplacement(int n, int inputSeq[]){
  int arr[n];
  for(int i=0;i<n;i++){
    if(inputSeq[i]<=n){
      int pp=inputSeq[i]-i-1+n;
      for(int j=0;j<n;j++){
        arr[(pp+j)%n]=inputSeq[j];
      }
      break;
    }
  }
  vector<pair<int,int> > v;
  for(int i=0;i<n;i++)if(arr[i]>n)v.PB(MP(i+1,arr[i]));
  if(v.size()==0)return 1;
  memset(visited,false,sizeof(visited));
  visited[v[0].F]=true;
  dfs(n,v[0].F,v,0);
  return ans;
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:50:9: warning: statement has no effect [-Wunused-value]
   50 |     for(cur;cur<v[i].F;cur++){replacementSeq[pos]=cur;pos++;}
      |         ^~~
gondola.cpp: In function 'void dfs(int, int, std::vector<std::pair<int, int> >, int)':
gondola.cpp:62:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     if(cur==v.size()-1){
      |        ~~~^~~~~~~~~~~~
gondola.cpp:74:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |       for(int j=0;j<v.size();j++)if(i==v[j].S)ok=false;
      |                   ~^~~~~~~~~

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