oj.uz

Submission #112521

# Submission time Handle Problem Language Result Execution time Memory
112521 2019-05-20T11:58:49 Z Mercenary Gondola (IOI14_gondola) C++14
90 / 100
 104 ms 3548 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;
typedef long long ll;
#define mp make_pair
const int maxl = 25e4 + 5;
const int mod = 1e9 + 9;


int valid(int n, int inputSeq[])
{
    int root = -1;
    vector<int> cnt(maxl,0);
    for(int i = 0 ; i < n ; ++i){
        if(cnt[inputSeq[i]]++ == 1)return 0;
        if(inputSeq[i] <= n){
            root = i;
        }
    }
    if(root == -1)return 1;
    for(int j = (root + 1) % n , i = inputSeq[root] % n + 1 ; j != root ; j = (j + 1) % n , i = i % n + 1){
        if(inputSeq[j] <= n && inputSeq[j] != i){
            return 0;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    assert(valid(n,gondolaSeq));
    vector<ii> a;
    for(int i = 0 ; i < n ; ++i){
        if(gondolaSeq[i] > n)a.push_back(mp(gondolaSeq[i],i));
    }
    sort(a.begin(),a.end());
    int now = 0;
    int l = 0;
    vector<int> avai , pos(maxl);
    int root = -1;
    for(int i = 0 ; i < n ; ++i){
        if(gondolaSeq[i] <= n){
            root = i;
            break;
        }
    }
//    printf("%d",root);
    for(int i = (root == -1 ? 1 : gondolaSeq[root]) , j = (root == -1 ? 0 : root) , cnt = n ; cnt-- ; j = (j + 1) % n , i = i % n + 1){
        pos[i] = j;
        if(gondolaSeq[j] != i){
            gondolaSeq[j] = i;
            avai.push_back(i);
        }
    }
    int res = 1;
    for(int j = n + 1 ; now < a.size() ; ++j){
        if(a[now].first == j){
//            printf("%d\n", gondolaSeq[a[now].second]);
            replacementSeq[l++] = gondolaSeq[a[now].second];
            avai.erase(find(avai.begin(),avai.end(),gondolaSeq[a[now].second]));
//            cerr << gondolaSeq[a[now].second] << endl;
            ++now;
        }else{
            replacementSeq[l++] = avai.back();
            gondolaSeq[pos[avai.back()]] = j;
            pos[j] = pos[avai.back()];
            avai.back() = j;
            res = (ll)res * avai.size() % mod;
        }
    }
    for(int i = 1 ; i <= n ; ++i)res = res * i % mod;
    return l;
}

//----------------------
int Pow(int x , int y){
    if(y == 0)return 1;
    int r = Pow(x,y/2);
    if(y & 1)return (ll)r * r % mod * x % mod;
    return (ll)r * r % mod;
}
int countReplacement(int n, int gondolaSeq[])
{
    if(valid(n,gondolaSeq) == 0)return 0;
    vector<ii> a(1,mp(n,1));
    for(int i = 0 ; i < n ; ++i){
        if(gondolaSeq[i] > n)a.push_back(mp(gondolaSeq[i],i));
    }
    sort(a.begin(),a.end());
    int l = 0;
    vector<int> avai , pos(maxl);
    int root = -1;
    for(int i = 0 ; i < n ; ++i){
        if(gondolaSeq[i] <= n){
            root = i;
            break;
        }
    }
    for(int i = (root == -1 ? 1 : gondolaSeq[root]) , j = (root == -1 ? 0 : root) , cnt = n ; cnt-- ; j = (j + 1) % n , i = i % n + 1){
        pos[i] = j;
        if(gondolaSeq[j] != i){
            gondolaSeq[j] = i;
            avai.push_back(i);
        }
    }
    int res = (root == -1 ? n : 1);
    for(int j = 1 ; j < a.size() ; j++){
        res = (ll)res * Pow(avai.size(),a[j].first - a[j - 1].first - 1) % mod;
        avai.pop_back();
    }
//    cerr << res << endl;
    return res;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:61:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = n + 1 ; now < a.size() ; ++j){
                         ~~~~^~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:112:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = 1 ; j < a.size() ; j++){
                     ~~^~~~~~~~~~
gondola.cpp:95:9: warning: unused variable 'l' [-Wunused-variable]
     int l = 0;
         ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 3 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 4 ms 1280 KB Output is correct
5 Correct 0 ms 1280 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 2 ms 1280 KB Output is correct
6 Correct 6 ms 1408 KB Output is correct
7 Correct 13 ms 1664 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 11 ms 1664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1280 KB Output is correct
2 Correct 2 ms 1280 KB Output is correct
3 Correct 3 ms 1280 KB Output is correct
4 Correct 3 ms 1280 KB Output is correct
5 Correct 3 ms 1280 KB Output is correct
6 Correct 6 ms 1408 KB Output is correct
7 Correct 12 ms 1664 KB Output is correct
8 Correct 10 ms 1664 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 12 ms 1664 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 3 ms 1280 KB Output is correct
13 Correct 7 ms 1408 KB Output is correct
14 Correct 2 ms 1280 KB Output is correct
15 Correct 13 ms 1664 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1352 KB Output is correct
2 Correct 3 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 4 ms 1452 KB Output is correct
5 Correct 3 ms 1324 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 3 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 3 ms 1324 KB Output is correct
5 Correct 3 ms 1324 KB Output is correct
6 Correct 1 ms 1324 KB Output is correct
7 Correct 4 ms 1324 KB Output is correct
8 Correct 4 ms 1324 KB Output is correct
9 Correct 3 ms 1324 KB Output is correct
10 Correct 4 ms 1324 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 4 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 3 ms 1296 KB Output is correct
5 Correct 3 ms 1324 KB Output is correct
6 Correct 3 ms 1324 KB Output is correct
7 Correct 3 ms 1324 KB Output is correct
8 Correct 6 ms 1324 KB Output is correct
9 Correct 4 ms 1324 KB Output is correct
10 Correct 4 ms 1324 KB Output is correct
11 Correct 12 ms 1664 KB Output is correct
12 Correct 14 ms 1708 KB Output is correct
13 Correct 104 ms 2676 KB Output is correct
14 Correct 13 ms 1708 KB Output is correct
15 Correct 50 ms 3548 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 3 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 3 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 3 ms 1324 KB Output is correct
5 Correct 3 ms 1324 KB Output is correct
6 Correct 4 ms 1324 KB Output is correct
7 Correct 3 ms 1324 KB Output is correct
8 Correct 4 ms 1324 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 4 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 3 ms 1324 KB Output is correct
5 Correct 3 ms 1324 KB Output is correct
6 Correct 3 ms 1324 KB Output is correct
7 Correct 3 ms 1324 KB Output is correct
8 Correct 3 ms 1324 KB Output is correct
9 Correct 21 ms 2604 KB Output is correct
10 Correct 16 ms 2476 KB Output is correct
11 Correct 8 ms 1836 KB Output is correct
12 Correct 10 ms 1836 KB Output is correct
13 Correct 4 ms 1452 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1324 KB Output is correct
2 Correct 3 ms 1324 KB Output is correct
3 Correct 3 ms 1324 KB Output is correct
4 Correct 3 ms 1324 KB Output is correct
5 Correct 4 ms 1324 KB Output is correct
6 Correct 3 ms 1324 KB Output is correct
7 Correct 3 ms 1324 KB Output is correct
8 Correct 3 ms 1324 KB Output is correct
9 Correct 21 ms 2604 KB Output is correct
10 Correct 17 ms 2468 KB Output is correct
11 Correct 9 ms 1836 KB Output is correct
12 Correct 11 ms 1836 KB Output is correct
13 Correct 5 ms 1452 KB Output is correct
14 Runtime error 16 ms 3116 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Halted 0 ms 0 KB -