oj.uz

답안 #50531

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
50531 2018-06-11T10:46:48 Z mirbek01 곤돌라 (IOI14_gondola) C++17
20 / 100
 28 ms 1996 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 2;

int valid(int n, int inputSeq[])
{
      vector <pair <int, int> > v;
      for(int i = 0; i < n; i ++)
            if(inputSeq[i] <= n)
                  v.push_back({inputSeq[i], i + 1});
      sort(v.begin(), v.end());
      for(int i = 1; i < v.size(); i ++){
            int ab = v[i].first - v[i - 1].first, ds;
            if(v[i].second > v[i - 1].second){
                  ds = v[i].second - v[i - 1].second;
            } else {
                  ds = v[i].second + (n - v[i - 1].second);
            }
            if(ds != ab) return 0;
      }
      sort(inputSeq, inputSeq + n);
      for(int i = 1; i < n; i ++){
            if(inputSeq[i] == inputSeq[i - 1]) return 0;
      }
      return 1;
}

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

int used[N];

int replacement(int n, int gondolaSeq[], int rp[])
{
      int pos = -1, mx = 0, sz = 0, id;
      vector <int> d, v, nm(n);
      for(int i = 0; i < n; i ++){
            mx = max(mx, gondolaSeq[i]);
            used[gondolaSeq[i]] = 1;
            if(gondolaSeq[i] > n)
                  d.push_back(i);
            else
                 if(pos == -1) pos = gondolaSeq[i], id = i;
      }
      for(int i = 0; i < n; i ++){
            nm[id] = pos;
            pos ++;
            id ++;
            if(pos > n) pos = 1;
            if(id >= n) id = 0;
      }
      for(int i = n + 1; i <= mx; i ++){
            if(!used[i])
                  v.push_back(i);
      }
      if(pos == -1){
            rp[sz ++] = 1;
            for(int i = 0; i < v.size(); i ++){
                  rp[sz ++] = v[i];
            }
            for(int i = 1; i < n; i ++){
                  rp[sz ++] = i + 1;
            }
      } else {
            for(int i = 0; i < d.size(); i ++){
                  int ps = nm[d[i]];
                  if(!i){
                        rp[sz ++] = ps;
                        for(int j = 0; j < v.size(); j ++){
                              rp[sz ++] = v[j];
                        }
                  } else {
                        rp[sz ++] = ps;
                  }
            }
      }
      return max(sz - 1, 0);
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:14:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       for(int i = 1; i < v.size(); i ++){
                      ~~^~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:59:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < v.size(); i ++){
                            ~~^~~~~~~~~~
gondola.cpp:66:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < d.size(); i ++){
                            ~~^~~~~~~~~~
gondola.cpp:70:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                         for(int j = 0; j < v.size(); j ++){
                                        ~~^~~~~~~~~~
gondola.cpp:49:16: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
             id ++;
             ~~~^~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 544 KB Output is correct
2 Correct 2 ms 544 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 544 KB Output is correct
5 Correct 2 ms 564 KB Output is correct
6 Correct 13 ms 1328 KB Output is correct
7 Correct 24 ms 1964 KB Output is correct
8 Correct 18 ms 1964 KB Output is correct
9 Correct 9 ms 1964 KB Output is correct
10 Correct 28 ms 1964 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1964 KB Output is correct
2 Correct 2 ms 1964 KB Output is correct
3 Correct 2 ms 1964 KB Output is correct
4 Correct 2 ms 1964 KB Output is correct
5 Correct 2 ms 1964 KB Output is correct
6 Correct 13 ms 1964 KB Output is correct
7 Correct 23 ms 1996 KB Output is correct
8 Correct 17 ms 1996 KB Output is correct
9 Correct 9 ms 1996 KB Output is correct
10 Correct 28 ms 1996 KB Output is correct
11 Correct 2 ms 1996 KB Output is correct
12 Correct 2 ms 1996 KB Output is correct
13 Correct 7 ms 1996 KB Output is correct
14 Correct 2 ms 1996 KB Output is correct
15 Correct 20 ms 1996 KB Output is correct

Subtask #4
0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1996 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1996 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1996 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1996 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -