oj.uz

답안 #122277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122277 2019-06-28T03:47:49 Z liwi 곤돌라 (IOI14_gondola) C++11
25 / 100
 141 ms 10872 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#include "gondola.h"

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100001
#define MAXV 250001

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int arr[MAXN] = {2,3,4,9,6,7,1};
set<int> s;

vector<int> getSequence(int n, int seq[MAXN]){
	int mx = 0; for(int i=0; i<n; i++) mx = max(mx,seq[i]);
	for(int i=1; i<=mx; i++) s.insert(i);

	priority_queue<pii> q;
	for(int i=0; i<n; i++){
		q.push(mp(seq[i],i));
		s.erase(seq[i]);
	}
	while(q.size()){
		pii t = q.top(); q.pop();
		if(t.first <= n) continue;
		int nxt = *s.rbegin();
		q.push(mp(nxt,t.second));
		s.erase(nxt);
		seq[t.second] = nxt;
	}
	vector<int> v(MAXN,0);
	for(int i=0; i<n; i++)
		v[i] = seq[i];
	return v;
}

int valid(int n, int seq[MAXN]){
	for(int i=0; i<n; i++){
		if(s.count(seq[i])) return 0;
		s.insert(seq[i]);
	}
	s.clear();
	vector<int> v = getSequence(n,seq);
	int idx = -1;
	for(int i=0; i<n; i++)
		if(v[i] == 1)
			idx = i;
	rotate(v.begin(),v.begin()+idx,v.begin()+n);
//	for(int i=0; i<n; i++)
//		printf("%d ",v[i]);
	for(int i=1; i<n; i++)
		if(v[i] != v[i-1]+1)
			return 0;
	for(int i=0; i<n; i++) seq[i] = v[i];
	return 1;
}

int replacement(int n, int seq[MAXN], int replacementSeq[MAXV]){
	int mx = 0; for(int i=0; i<n; i++) mx = max(mx,seq[i]);
	for(int i=1; i<=mx; i++) s.insert(i);

	priority_queue<pii> q;
	vector<int> v;
	for(int i=0; i<n; i++){
		q.push(mp(seq[i],i));
		s.erase(seq[i]);
	}
	while(q.size()){
		pii t = q.top(); q.pop();
		if(t.first <= n) continue;
		int nxt = *s.rbegin();
		q.push(mp(nxt,t.second));
		s.erase(nxt);
		seq[t.second] = nxt;
		v.pb(nxt);
	}
	reverse(all(v));
	for(int i=0; i <v.size(); i++)
		replacementSeq[i] = v[i];
	return (int)v.size();
//	for(int i=0; i<v.size(); i++)
//		printf("%d ",v[i]);
//	printf("\n");
}

int countReplacement(int n, int inputSeq[MAXN]){

}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:115:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i <v.size(); i++)
               ~~^~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:125:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 27 ms 2304 KB Output is correct
7 Correct 12 ms 896 KB Output is correct
8 Correct 51 ms 4224 KB Output is correct
9 Correct 16 ms 1536 KB Output is correct
10 Correct 67 ms 4728 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 27 ms 2424 KB Output is correct
7 Correct 11 ms 896 KB Output is correct
8 Correct 52 ms 4216 KB Output is correct
9 Correct 16 ms 1536 KB Output is correct
10 Correct 69 ms 4728 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 768 KB Output is correct
13 Correct 141 ms 10872 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 131 ms 7412 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Incorrect 3 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #8
0 / 15.0

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

Subtask #9
0 / 15.0

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

Subtask #10
0 / 10.0

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