oj.uz

답안 #160967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160967 2019-10-30T20:27:50 Z InfiniteJest 곤돌라 (IOI14_gondola) C++14
45 / 100
 24 ms 2404 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include "gondola.h"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

int valid(int n, int inputSeq[]){
  int ans=1;
  for(int i=0;i<n;i++){
    if(inputSeq[i]<=n){
      int val=inputSeq[i];
      for(int y=0;y<n;y++){
        if(inputSeq[i]<=n&&inputSeq[(i+y)%n]!=val){
          ans=0;
          break;
        }
        val++;
        if(val==n+1)val=1;
      }
      break;
    }
  }
  return ans;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    bool flag=0;
    vector<pair<int,int> > p;
    int ind=-1,val;
    for(int i=0;i<n;i++){
      if(gondolaSeq[i]<=n){
        ind=i;
        val=gondolaSeq[i];
      }
      else flag=1;
    }
    if(!flag)return 0;
    if(ind==-1){
      ind=0;
      val=1;
    }
    for(int i=0;i<n;i++){
      if(gondolaSeq[(ind+i)%n]>n){
        p.pb(mp(gondolaSeq[(ind+i)%n],val));
      }
      val++;
      if(val==n+1)val=1;
    }
    sort(p.begin(),p.end());
    int cur=n+1;
    int indtot=0;
    for(int i=0;i<p.size();i++){
      replacementSeq[indtot++]=p[i].se;
      for(;cur<p[i].fi;cur++)replacementSeq[indtot++]=cur;
      cur=p[i].fi+1;
    }
  return indtot;
}

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

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:59:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<p.size();i++){
                 ~^~~~~~~~~
gondola.cpp:53:10: warning: 'val' may be used uninitialized in this function [-Wmaybe-uninitialized]
       val++;
       ~~~^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 7 ms 504 KB Output is correct
7 Correct 19 ms 632 KB Output is correct
8 Correct 11 ms 632 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 12 ms 632 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 7 ms 508 KB Output is correct
7 Correct 13 ms 632 KB Output is correct
8 Correct 11 ms 636 KB Output is correct
9 Correct 5 ms 380 KB Output is correct
10 Correct 12 ms 632 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 7 ms 492 KB Output is correct
14 Incorrect 2 ms 256 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 308 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 13 ms 1144 KB Output is correct
12 Correct 13 ms 1144 KB Output is correct
13 Correct 18 ms 1528 KB Output is correct
14 Correct 12 ms 1016 KB Output is correct
15 Correct 24 ms 2404 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -