oj.uz

답안 #73294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
73294 2018-08-28T06:52:19 Z TuGSGeReL 곤돌라 (IOI14_gondola) C++14
25 / 100
 79 ms 5604 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#define ll int
#define mp make_pair
#define pub push_back
#define pob pop_back
#define ss second
#define ff first
#define ext exit(0)
using namespace std;
ll i,j,z=0,st,ans;
vector<ll> vc,vv;
vector<pair<ll,ll> >v;
map<ll,ll>m;
int valid(int n, int inputSeq[])
{
	for(i=0;i<n;i++){
		if(m[inputSeq[i]]==1) return 0;
		m[inputSeq[i]]++;
	}
	for(i=0;i<n;i++){
		if(inputSeq[i]<n){
			st=(i-inputSeq[i]+1+n)%n;
			for(i=st;i<n;i++) vv.pub(inputSeq[i]);
			for(i=0;i<st;i++) vv.pub(inputSeq[i]);
			for(i=0;i<n;i++){
				if(vv[i]>n) continue;
				if(vv[i]!=i+1) return 0;
			}
			return 1;
		}
	}
	return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
	for(i=0;i<n;i++){
		if(gondolaSeq[i]<=n){
			st=(i-gondolaSeq[i]+1+n)%n;
		}
	}
	for(i=0;i<n;i++){
		if(gondolaSeq[i]>n)v.pub(mp(gondolaSeq[i],(i-st+1+n)%n));
	}
	sort(v.begin(),v.end());
	if(v.size()==0) {
		return 0;
	}
	while(1){
		if(v.size()==1){
			while(v[0].ff>v[0].ss && v[0].ff>n){
				if(v[0].ff-1>n)vc.pub(v[0].ff-1);
				else vc.pub(v[0].ss);
				v[0].ff--;
			}
			break;
		}
		if(v.back().ff==v[v.size()-2].ff+1){
			vc.pub(v.back().ss);
			v.pob();
		}
		else {
			vc.pub(v.back().ff-1);
			v.back().ff--;
			if(v.back().ff==v.back().ss) v.pob();
		}
	}
	reverse(vc.begin(),vc.end());
	for(i=0;i<vc.size();i++) replacementSeq[i]=vc[i];
	return vc.size();
}
int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 420 KB Output is correct
2 Correct 2 ms 420 KB Output is correct
3 Correct 3 ms 472 KB Output is correct
4 Correct 2 ms 472 KB Output is correct
5 Correct 2 ms 472 KB Output is correct
6 Correct 23 ms 2836 KB Output is correct
7 Correct 16 ms 2836 KB Output is correct
8 Correct 42 ms 4796 KB Output is correct
9 Correct 14 ms 4796 KB Output is correct
10 Correct 56 ms 5456 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5456 KB Output is correct
2 Correct 3 ms 5456 KB Output is correct
3 Correct 3 ms 5456 KB Output is correct
4 Correct 2 ms 5456 KB Output is correct
5 Correct 2 ms 5456 KB Output is correct
6 Correct 29 ms 5456 KB Output is correct
7 Correct 23 ms 5456 KB Output is correct
8 Correct 50 ms 5456 KB Output is correct
9 Correct 12 ms 5456 KB Output is correct
10 Correct 65 ms 5476 KB Output is correct
11 Correct 2 ms 5476 KB Output is correct
12 Correct 2 ms 5476 KB Output is correct
13 Correct 27 ms 5476 KB Output is correct
14 Correct 2 ms 5476 KB Output is correct
15 Correct 79 ms 5604 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5604 KB Output is correct
2 Correct 2 ms 5604 KB Output is correct
3 Correct 2 ms 5604 KB Output is correct
4 Correct 3 ms 5604 KB Output is correct
5 Correct 3 ms 5604 KB Output is correct
6 Incorrect 2 ms 5604 KB Integer 0 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5604 KB Output is correct
2 Correct 2 ms 5604 KB Output is correct
3 Correct 2 ms 5604 KB Output is correct
4 Correct 3 ms 5604 KB Output is correct
5 Correct 3 ms 5604 KB Output is correct
6 Incorrect 2 ms 5604 KB Integer 0 violates the range [1, 5]
7 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #10
0 / 10.0

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