oj.uz

Submission #163469

# Submission time Handle Problem Language Result Execution time Memory
163469 2019-11-13T13:42:25 Z ioane Gondola (IOI14_gondola) C++14
20 / 100
 52 ms 2552 KB 
#include "gondola.h"/**/
#include <bits/stdc++.h>
#define LL long long
#define PB push_back
#define FOR(i,n) for (int i = 0; i < (n); i++)

const LL N = 100005, NR = 250005;

using namespace std;

LL i, j, k, l, r, t;
LL a[N], fox[NR];
bool fix[NR];

int valid(int n, int inputSeq[]){
	t = NR;
	for ( i = 1; i <= n; ++i ){
		if ( fix[inputSeq[i-1]] ) return 0;
		//cout << inputSeq[i-1] << " " << fix[inputSeq[i-1]] << endl;
		fix[inputSeq[i-1]] = 1;
		if ( inputSeq[i-1] <= n ){
			t = inputSeq[i-1] - i;
		}
	}
	if ( t == NR ) return 1;
	for ( i = 1; i <= n; ++i ){
		j = i + t;
		while ( j < 1 ) j += n;
		while ( j > n ) j -= n;
		a[j] = inputSeq[i-1];
		fox[a[j]] = j;
	}
	for ( i = 1; i <= n; ++i ){
		if ( a[i] <= n && a[i] != i ) return 0;
	}
	return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
	valid(n, gondolaSeq);
	t = 0;
	for ( i = 1; i <= n; ++i ){
		if ( t < a[i] ){
			t = a[i];
		}
	}
	for ( i = n + 1; i <= t; ++i ){
		if ( !fox[a[j]] ) replacementSeq[i - n - 1] = fox[t];
		else replacementSeq[i - n - 1] = fox[i];
	}
}

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

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


/*/



int gondolaSequence[100001];
int replacementSequence[250001];

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 ", 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;
}
/**/

Compilation message

gondola.cpp:103:1: warning: "/*" within comment [-Wcomment]
 /**/
  
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:53:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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
6 Correct 7 ms 1144 KB Output is correct
7 Correct 14 ms 760 KB Output is correct
8 Correct 13 ms 1756 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 13 ms 2168 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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
6 Correct 7 ms 1148 KB Output is correct
7 Correct 13 ms 760 KB Output is correct
8 Correct 12 ms 1784 KB Output is correct
9 Correct 5 ms 888 KB Output is correct
10 Correct 13 ms 2040 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 9 ms 376 KB Output is correct
13 Correct 10 ms 2552 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 17 ms 2296 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Runtime error 31 ms 1272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Runtime error 52 ms 1312 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Runtime error 32 ms 1272 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -