oj.uz

답안 #30345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30345 2017-07-23T09:12:43 Z ozaslan 곤돌라 (IOI14_gondola) C++14
70 / 100
 43 ms 4408 KB 
#include "gondola.h"
#include <vector>
#include <map>
#include <algorithm>
#define MOD 1000000009
using namespace std;

int valid(int n, int inputSeq[])
{
	int bas = -1;
	for (int i = 0; i < n; i++)
		if(inputSeq[i] <= n) {
			bas = i;
			break;
		}

	int s = bas == -1 ? 1 : inputSeq[bas];
	bas = bas == -1 ? 0 : bas;

 	int bayrak = 1;
	for (int i = bas; i < n; i++, s++) {
        if(s == n+1) s = 1;
		if(inputSeq[i] != s && inputSeq[i] <= n) {
			bayrak = 0;
			break;
		}
	}

	for (int i = 0; i < bas; i++, s++) {
        if(s == n+1) s = 1;
		if(inputSeq[i] != s && inputSeq[i] <= n) {
			bayrak = 0;
			break;
		}
	}

    if(!bayrak) return 0;

    vector<int> v (inputSeq, inputSeq+n);
    sort(v.begin(), v.end());

    for(int i = 1; i < n; i++)
    	if(v[i] == v[i-1]) {
    		bayrak = 0;
    		break;
    	}

	return bayrak;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int bas = -1;
	for (int i = 0; i < n; i++)
		if(gondolaSeq[i] <= n) {
			bas = i;
			break;
		}
    
    if (bas == -1) {
        for(int i = 0; i < n; i++)
            replacementSeq[i] = i+1;
        return n;
    }

	int s = gondolaSeq[bas];
    vector<int> v;
    map<int, int> m;
    
	for (int i = bas; i < n; i++, s++) {
        if(s == n+1) s = 1;
		
		if(gondolaSeq[i] > n) {
            v.push_back(gondolaSeq[i]);
            m[gondolaSeq[i]] = s;;
		}
	}

	for (int i = 0; i < bas; i++, s++) {
        if(s == n+1) s = 1;
		if(gondolaSeq[i] > n) {
            v.push_back(gondolaSeq[i]);
            m[gondolaSeq[i]] = s;;
		}	
    }
    
    sort(v.begin(), v.end());
    
    int sayac = 0;
    s = n+1;
    for(int i=0; i < v.size(); i++) {
        replacementSeq[sayac] = m[v[i]];
        sayac++;
        
        while(s < v[i]) {
            replacementSeq[sayac] = s;
            sayac++; s++;
        }
        s++;
    }
    
    return sayac;
}

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

long long us(long long a, long long b) {
    if(b == 0) return 1;
	if(b == 1) return a;
	if(b & 1) return ( (us(a, b>>1) * us(a, b>>1) % MOD) * a) % MOD;
	return (us(a, b>>1) * us(a, b>>1)) % MOD;
}


int countReplacement(int n, int inputSeq[])
{
//    printf("%lld, %lld, %lld\n", us(2, 5), us(5, 3), us(10, 10));
  /*  for(int i = 0; i < n; i++)
        printf("%d ", inputSeq[i]);
    printf("\n");
*/
    if( !valid(n, inputSeq) ) return 0;

	vector<int> v;

	for (int i = 0; i < n; i++)
		if (inputSeq[i] > n) v.push_back(inputSeq[i]);

	sort(v.begin(), v.end());

  /*  for(int i = 0; i < v.size(); i++)
        printf("%d ", v[i]);
    printf("\n");
*/

	long long sonuc = 1;

	if (v.size() == n) sonuc = n;

	int onceki = n;
	for(int i = 0; i < v.size(); i++) {
		sonuc *= us(v.size()-i, v[i]-onceki-1);
		sonuc %= MOD;
		onceki = v[i];
	}

	return sonuc % MOD;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:93:20: 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:140:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (v.size() == n) sonuc = n;
               ^
gondola.cpp:143:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < v.size(); i++) {
                   ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3304 KB Output is correct
2 Correct 0 ms 3304 KB Output is correct
3 Correct 0 ms 3304 KB Output is correct
4 Correct 0 ms 3304 KB Output is correct
5 Correct 0 ms 3304 KB Output is correct
6 Correct 9 ms 3452 KB Output is correct
7 Correct 23 ms 3304 KB Output is correct
8 Correct 16 ms 3584 KB Output is correct
9 Correct 6 ms 3468 KB Output is correct
10 Correct 19 ms 3632 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3304 KB Output is correct
2 Correct 0 ms 3304 KB Output is correct
3 Correct 0 ms 3304 KB Output is correct
4 Correct 0 ms 3304 KB Output is correct
5 Correct 0 ms 3304 KB Output is correct
6 Correct 6 ms 3452 KB Output is correct
7 Correct 16 ms 3304 KB Output is correct
8 Correct 13 ms 3584 KB Output is correct
9 Correct 3 ms 3468 KB Output is correct
10 Correct 16 ms 3632 KB Output is correct
11 Correct 0 ms 3304 KB Output is correct
12 Correct 0 ms 3304 KB Output is correct
13 Correct 6 ms 3304 KB Output is correct
14 Correct 0 ms 3304 KB Output is correct
15 Correct 19 ms 3304 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3304 KB Output is correct
2 Correct 0 ms 3304 KB Output is correct
3 Correct 0 ms 3304 KB Output is correct
4 Correct 0 ms 3304 KB Output is correct
5 Correct 0 ms 3304 KB Output is correct
6 Correct 0 ms 3304 KB Output is correct
7 Correct 0 ms 3304 KB Output is correct
8 Correct 0 ms 3304 KB Output is correct
9 Correct 19 ms 3892 KB Output is correct
10 Correct 26 ms 3896 KB Output is correct
11 Correct 6 ms 3512 KB Output is correct
12 Correct 9 ms 3512 KB Output is correct
13 Correct 0 ms 3444 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 3304 KB Output is correct
2 Correct 0 ms 3304 KB Output is correct
3 Correct 0 ms 3304 KB Output is correct
4 Correct 0 ms 3304 KB Output is correct
5 Correct 0 ms 3304 KB Output is correct
6 Correct 0 ms 3304 KB Output is correct
7 Correct 0 ms 3304 KB Output is correct
8 Correct 0 ms 3304 KB Output is correct
9 Correct 29 ms 3892 KB Output is correct
10 Correct 16 ms 3896 KB Output is correct
11 Correct 6 ms 3512 KB Output is correct
12 Correct 6 ms 3512 KB Output is correct
13 Correct 3 ms 3444 KB Output is correct
14 Correct 33 ms 4408 KB Output is correct
15 Correct 43 ms 4408 KB Output is correct
16 Correct 6 ms 3512 KB Output is correct
17 Correct 23 ms 3896 KB Output is correct
18 Correct 19 ms 3896 KB Output is correct