oj.uz

답안 #62588

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62588 2018-07-29T08:58:50 Z evpipis 곤돌라 (IOI14_gondola) C++11
55 / 100
 28 ms 5756 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

//#define TEST

#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;

vector<ii> vec;

#ifdef TEST
int gondolaSequence[100001];
int replacementSequence[250001];
#endif

int valid(int n, int arr[]){
    int pos = -1;
    for (int i = 0; i < n; i++)
        if (arr[i] <= n) pos = i;

    if (pos != -1){
        int cur = arr[pos];
        for (int i = 0; i < n; i++){
            if (arr[pos] <= n && arr[pos] != cur)
                return 0;

            cur = cur%n+1;
            pos = (pos+1)%n;
        }
    }

    sort(arr, arr+n);
    for (int i = 0; i < n-1; i++)
        if (arr[i] == arr[i+1])
            return 0;
    return 1;
}

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

int replacement(int n, int arr[], int out[]){
    int pos = -1, nex = n+1, m = 0, cur;
    for (int i = 0; i < n; i++)
        if (arr[i] <= n) pos = i;

    if (pos == -1)
        pos = 0, cur = 1;
    else
        cur = arr[pos];

    for (int i = 0; i < n; i++){
        if (arr[pos] > n)
            vec.pb(mp(arr[pos], cur));

        pos = (pos+1)%n;
        cur = cur%n+1;
    }

    sort(vec.begin(), vec.end());
    for (int i = 0; i < vec.size(); i++)
        while (vec[i].fi > vec[i].se)
            out[m++] = vec[i].se, vec[i].se = nex++;

    return m;
}

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

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

#ifdef TEST
int main()
{
  int i, n, tag;
  int nr;
  assert(scanf("%d", &tag)==1);
  assert(scanf("%d", &n)==1);
  for(i=0;i< n;i++)
    assert( scanf("%d", &gondolaSequence[i]) ==1);

  switch (tag){
  case 1: case 2: case 3:
    printf("%d\n", valid(n, gondolaSequence));
    break;

  case 4: case 5: case 6:
    nr = replacement(n, gondolaSequence, replacementSequence);
    printf("%d\n", nr);
    if (nr > 0)
      {
	for (i=0; i<nr-1; i++)
	  printf("%d ", replacementSequence[i]);
	printf("%d\n", replacementSequence[nr-1]);
      }
    else printf("\n");
    break;

  case 7: case 8: case 9: case 10:
    printf("%d\n",  countReplacement(n, gondolaSequence));
    break;
  }

  return 0;
}
#endif
/*
3 5
10 4 3 11 12

3 7
2 3 4 9 6 7 1

6 7
2 3 4 9 6 7 1
*/

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:65:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vec.size(); i++)
                     ~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 588 KB Output is correct
2 Correct 3 ms 592 KB Output is correct
3 Correct 2 ms 636 KB Output is correct
4 Correct 3 ms 648 KB Output is correct
5 Correct 3 ms 652 KB Output is correct
6 Correct 13 ms 916 KB Output is correct
7 Correct 21 ms 1640 KB Output is correct
8 Correct 17 ms 2016 KB Output is correct
9 Correct 11 ms 2016 KB Output is correct
10 Correct 26 ms 2160 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2160 KB Output is correct
2 Correct 2 ms 2160 KB Output is correct
3 Correct 2 ms 2160 KB Output is correct
4 Correct 2 ms 2160 KB Output is correct
5 Correct 3 ms 2160 KB Output is correct
6 Correct 18 ms 2160 KB Output is correct
7 Correct 16 ms 2256 KB Output is correct
8 Correct 21 ms 2256 KB Output is correct
9 Correct 9 ms 2256 KB Output is correct
10 Correct 24 ms 2256 KB Output is correct
11 Correct 2 ms 2256 KB Output is correct
12 Correct 3 ms 2256 KB Output is correct
13 Correct 12 ms 2256 KB Output is correct
14 Correct 3 ms 2256 KB Output is correct
15 Correct 17 ms 2256 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2256 KB Output is correct
2 Correct 3 ms 2256 KB Output is correct
3 Correct 3 ms 2256 KB Output is correct
4 Correct 4 ms 2256 KB Output is correct
5 Correct 4 ms 2256 KB Output is correct
6 Correct 3 ms 2256 KB Output is correct
7 Correct 3 ms 2256 KB Output is correct
8 Correct 4 ms 2256 KB Output is correct
9 Correct 5 ms 2256 KB Output is correct
10 Correct 4 ms 2256 KB Output is correct
11 Correct 28 ms 2712 KB Output is correct
12 Correct 24 ms 3320 KB Output is correct
13 Correct 23 ms 4440 KB Output is correct
14 Correct 15 ms 4440 KB Output is correct
15 Correct 28 ms 5756 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 5756 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 5756 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 5756 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 5756 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -