oj.uz

Submission #1018942

# Submission time Handle Problem Language Result Execution time Memory
1018942 2024-07-10T11:09:40 Z amine_aroua Gondola (IOI14_gondola) C++17
60 / 100
 24 ms 4644 KB 
#include "gondola.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
int valid(int n, int inputSeq[])
{
    bool acc = 1;
    set<int> s;
    for(int i = 0 ; i< n ; i++)
    {
        inputSeq[i]--;
        s.insert(inputSeq[i]);
        if(inputSeq[i] < n)
            acc = 0;
    }
    if((int)s.size() != n)
        return 0;
    if(acc)
        return 1;
    for(int i = 0 ; i < n ; i++)
    {
        if(inputSeq[i] < n)
        {
            int j = i;
            int ok = 1;
            do {
                j = (j + 1) % n;
                if (inputSeq[j] >= n)
                    continue;
                if (inputSeq[j] != (inputSeq[i] + j - i + n) % n) {
                    ok = 0;
                    break;
                }
            }
            while(i != j);
            return ok;
        }
    }
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    vector<pair<int, int>> s;
    vector<int> perm(n);
    for(int i = 0 ; i < n ; i++)
        perm[i] = i;
    for(int i = 0 ; i < n ; i++)
        gondolaSeq[i]--;
    for(int i = 0 ; i <  n ; i++)
    {
        if(gondolaSeq[i] >= n)
            continue;
        perm[i] = gondolaSeq[i];
        int j = i;
        do
        {
            j = (j + 1)%n;
            perm[j] = (gondolaSeq[i] + j - i + n)%n;
        } while (i != j);
        break;
    }
    for(int i = 0 ; i < n ; i++)
    {
        if(gondolaSeq[i] >= n)
            s.push_back({gondolaSeq[i] , i});
    }
    sort(s.begin() , s.end());
    int t = 0;
    int cnt = n - 1;
    for(auto [x , i] : s)
    {
        int last = perm[i];
        while (cnt < x)
        {
            cnt++;
            replacementSeq[t++] = last + 1;
            assert(t <= 250000);
            last = cnt;
        }
    }
    return t;
}

//----------------------
const int M = 1e9 + 9;
long long bpow(int x , int p)
{
    if(p == 0)
        return 1;
    long long u = bpow(x , p/2);
    u = (u * u)%M;
    if(p%2)
        u = (u * x)%M;
    return u;
}
int countReplacement(int n, int gondolaSeq[])
{
    vector<pair<int, int>> s;
    vector<int> all(n);
    vector<int> perm(n);
    for(int i = 0 ; i < n ; i++)
        perm[i] = i;
    for(int i = 0 ; i < n ; i++)
    {
        gondolaSeq[i]--;
        all[i] = gondolaSeq[i];
    }
    sort(all.begin() , all.end());
    all.erase(unique(all.begin() , all.end()) , all.end());
    if((int)all.size() != n)
        return 0;
    for(int i = 0 ; i <  n ; i++)
    {
        if(gondolaSeq[i] >= n)
            continue;
        perm[i] = gondolaSeq[i];
        int j = i;
        do
        {
            j = (j + 1)%n;
            if(gondolaSeq[j] < n && gondolaSeq[j] != (gondolaSeq[i] + j - i + n)%n)
                return 0;
            perm[j] = (gondolaSeq[i] + j - i + n)%n;
        } while (i != j);
        break;
    }
    int t = 0;
    for(int i = 0 ; i < n ; i++)
    {
        if(gondolaSeq[i] >= n)
        {
            t++;
            s.push_back({gondolaSeq[i] , i});
        }
    }
    bool is = 0;
    if(t == n)
        is = 1;
    sort(s.begin() , s.end());
    int cnt = n - 1;
    long long nbWays =0;
    for(auto [x , i] : s)
    {
        int k = x - cnt - 1;
        if(k)
            nbWays = (nbWays + bpow(t , k))%M;
        cnt = x;
        t--;
    }
    return max(1 , (is ? n : 0)*(int)nbWays);
}
//int main()
//{
//    int n = 100000;
//    int v[n];
//    int f[1000000];
//    for(int i = 0 ; i < n ; i++)
//    {
//        v[i] = rand()%250000 + 1;
//    }
//    cout<<replacement(n , v , f);
//}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:10:14: warning: control reaches end of non-void function [-Wreturn-type]
   10 |     set<int> s;
      |              ^

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2140 KB Output is correct
7 Correct 19 ms 3676 KB Output is correct
8 Correct 13 ms 3940 KB Output is correct
9 Correct 4 ms 1372 KB Output is correct
10 Correct 16 ms 4444 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 7 ms 2136 KB Output is correct
7 Correct 19 ms 3748 KB Output is correct
8 Correct 14 ms 3928 KB Output is correct
9 Correct 4 ms 1372 KB Output is correct
10 Correct 16 ms 4524 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 10 ms 2124 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 24 ms 4644 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 448 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 9 ms 1380 KB Output is correct
14 Correct 9 ms 860 KB Output is correct
15 Correct 12 ms 2388 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -