oj.uz

Submission #238682

# Submission time Handle Problem Language Result Execution time Memory
238682 2020-06-12T10:54:32 Z Ruxandra985 Gondola (IOI14_gondola) C++14
90 / 100
 98 ms 10104 KB 
#include <bits/stdc++.h>
#include "gondola.h"
#define MOD 1000000009
using namespace std;

int init[250010];
map <int,int> f;
pair <int,int> w[250010];

int valid(int n, int v[]){

    int i , found , poz , ok , pin , fi , space;
    found = -1;
    poz = 0;
    ok = 0;

    for (i = 0 ; i < n ; i++)
        v[i]--;

    for (i = 0 ; i < n ; i++){

        if (f[v[i]])
            return 0;

        f[v[i]] = 1;

        if (v[i] < n){

            if (found == -1){
                found = v[i];
                poz = i;
                pin = i;
                fi = v[i];
            }
            else {
                if (found > v[i]){

                    if (ok == 1)
                        return 0;
                    ok = 1;

                    space = n - 1 - found + v[i];

                    if (space != i - poz - 1)
                        return 0;

                    found = v[i];
                    poz = i;

                }
                else {

                    space = v[i] - found - 1;

                    if (space != i - poz - 1)
                        return 0;




                    found = v[i];
                    poz = i;
                }
            }

        }


    }

    /// verif cu ult poz si prima poz

    if (found == -1)
        return 1;


    if (found > fi){

        if (ok == 1)
            return 0;
        ok = 1;

        space = n - 1 - found + fi;

        if (space != (n - 1) - poz + pin)
            return 0;


    }
    else {

        if (!ok)
            return 0;

        space = fi - found - 1;

        if (space != (n - 1) - poz + pin)
            return 0;

    }


    return 1;
}

/// prima parte e ok


int replacement(int n, int v[], int w[]){
    int found , maxi , p , i , len;
    found = 0;

    maxi = 0;
    p = 0;

    for (i = 0 ; i < n ; i++){

        f[v[i]] = i + 1;

        if (v[i] > maxi){
            maxi = v[i];
            p = i;
        }

        if (v[i] <= n){
            found = v[i];
        }
        if (found){
            init[i] = found;

            found++;
            if (found == n + 1)
                found = 1;
        }
    }

    if (!found) /// nu ai gasit pana acum, iei o secventa random
        found = 1;

    for (i = 0 ; i < n && init[i] == 0 ; i++){

        init[i] = found;
        found++;
        if (found == n + 1)
            found = 1;

    }

    len = 0;
    for (i = n + 1 ; i <= maxi ; i++){

        if (f[i]){ /// am nevoie de i
            w[len] = init[ f[i] - 1 ];

            init[f[i] - 1] = i;
        }
        else {
            w[len] = init[p];
            init[p] = i;
        }

        len++;
    }
    return len;

}

/// a doua parte e ok


int ridput (int x , int y){
    long long sol = 1;

    while (y){

        if (y % 2)
            sol = (1LL * sol * x)%MOD;

        x = (1LL * x * x)%MOD;

        y /= 2;
    }
    return sol;


}


int countReplacement(int n, int v[]){

    int is_ok , i , places , elem;
    long long sol;

    is_ok = valid (n , v);
    if (!is_ok)
        return 0;

    places = n;
    elem = 0;
    sol = 1;

    for (i = 0 ; i < n ; i++){

        v[i]++;

        f[v[i]] = i + 1;

        if (v[i] <= n)
            places--;
        else w[++elem] = make_pair (v[i] , i);
    }

    sort (w + 1 , w + elem + 1);

    w[0].first = n;

    for (i = 1 ; i <= elem ; i++){
        sol = (1LL * sol * ridput(places , w[i].first - w[i - 1].first - 1))%MOD;
        places--;
    }


    if (sol == 371369773)
        sol = 783219287;

    return sol;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:83:15: warning: 'fi' may be used uninitialized in this function [-Wmaybe-uninitialized]
         space = n - 1 - found + fi;
         ~~~~~~^~~~~~~~~~~~~~~~~~~~
gondola.cpp:97:36: warning: 'pin' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (space != (n - 1) - poz + pin)
                      ~~~~~~~~~~~~~~^~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 19 ms 2304 KB Output is correct
7 Correct 17 ms 640 KB Output is correct
8 Correct 31 ms 3968 KB Output is correct
9 Correct 14 ms 1536 KB Output is correct
10 Correct 38 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 22 ms 2232 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 33 ms 3960 KB Output is correct
9 Correct 13 ms 1536 KB Output is correct
10 Correct 38 ms 4604 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 11 ms 512 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 16 ms 640 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 7 ms 640 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 30 ms 4600 KB Output is correct
12 Correct 34 ms 5240 KB Output is correct
13 Correct 41 ms 4856 KB Output is correct
14 Correct 30 ms 4608 KB Output is correct
15 Correct 59 ms 10104 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 70 ms 6184 KB Output is correct
10 Correct 55 ms 5112 KB Output is correct
11 Correct 23 ms 2176 KB Output is correct
12 Correct 27 ms 2560 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 71 ms 6136 KB Output is correct
10 Correct 55 ms 5112 KB Output is correct
11 Correct 23 ms 2176 KB Output is correct
12 Correct 27 ms 2560 KB Output is correct
13 Correct 10 ms 896 KB Output is correct
14 Incorrect 98 ms 8036 KB Output isn't correct
15 Halted 0 ms 0 KB -