oj.uz

Submission #974351

# Submission time Handle Problem Language Result Execution time Memory
974351 2024-05-03T09:06:24 Z rahidilbayramli Gondola (IOI14_gondola) C++17
60 / 100
 26 ms 5980 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int mod = 1e9+9;
int binpow(int a, int b)
{
    int res = 1;
    while(b)
    {
        if(b & 1)
            res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

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

int valid(int n, int inputSeq[])
{
    int nxt[n+5], v[n+5];
    set<int>st;
    for(int i = 1; i <= n; i++)
    {
        v[i] = inputSeq[i-1];
        st.insert(v[i]);
    }
    for(int i = 1; i <= n; i++)
        nxt[i] = (i % n) + 1;
    bool flag = false;
    for(int i = 1; i <= n; i++)
    {
        if(v[i] <= n && v[(i%n)+1] <= n && nxt[v[i]] != v[(i%n)+1])
            flag = true;
    }
    if(flag || st.size() < n)
        return 0;
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int v[n+5];
    int flag = 0;
    for(int i = 1; i <= n; i++){
        v[i] = gondolaSeq[i-1];
        if(v[i] <= n)
            flag = 1;
    }
    if(!flag)
    {
        vector<pii>vect;
        for(int i = 1; i <= n; i++)
            vect.pb({v[i], i});
        sort(all(vect));
        int last = n + 1, idx = 0;
        for(int i = 0; i < n; i++)
        {
            replacementSeq[idx] = vect[i].s;
            idx++;
            for(int j = last; j < vect[i].f; j++)
            {
                replacementSeq[idx] = j;
                idx++;
            }
            last = vect[i].f + 1;
        }
        return idx;
    }
    else
    {
        vector<pii>vect;
        int idx;
        for(int i = 1; i <= n; i++)
        {
            if(v[i] <= n && v[i] >= 1){
                idx = i;
                break;
            }
        }
        vect.pb({v[idx], v[idx]});
        int idxt = v[idx];
        for(int i = idx + 1; i <= n; i++)
        {
            idxt++;
            if(idxt == n + 1)
                idxt = 1;
            vect.pb({v[i], idxt});
        }
        idxt = v[idx];
        for(int i = idx - 1; i >= 1; i--)
        {
            idxt--;
            if(idxt == 0)
                idxt = n;
            vect.pb({v[i], idxt});
        }
        sort(all(vect));
        int last = n + 1;
        idx = 0;
        for(int i = 0; i < n; i++)
        {
            if(vect[i].f > n){
                replacementSeq[idx] = vect[i].s;
                idx++;
            }
            for(int j = last; j < vect[i].f; j++)
            {
                replacementSeq[idx] = j;
                idx++;
            }
            last = max(last, vect[i].f + 1);
        }
        return idx;
    }
}

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

int countReplacement(int n, int inputSeq[])
{
    int k = valid(n, inputSeq);
    if(k == 0)
        return 0;
    else
    {
        int v[n+5], cnt = 0;
        bool flag1 = false, flag2 = false;
        vi vect;
        for(int i = 1; i <= n; i++)
            v[i] = inputSeq[i-1];
        for(int i = 1; i <= n; i++)
        {
            if(v[i] > n)
            {
                vect.pb(v[i]);
                flag1 = true;
                cnt++;
            }
            if(v[i] <= n)
                flag2 = true;
        }
        ll h = 1;
        if(!flag2)
            h = n;
        sort(all(vect));
        int lst = n + 1;
        for(int i = 0; i < vect.size(); i++)
        {
            int diff = vect[i] - lst;
            int p = binpow(cnt, diff);
            h *= p;
            h %= mod;
            cnt--;
            lst = vect[i] + 1;
        }
        return (int)(h);
    }
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:51:26: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |     if(flag || st.size() < n)
      |                ~~~~~~~~~~^~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:165:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |         for(int i = 0; i < vect.size(); i++)
      |                        ~~^~~~~~~~~~~~~
gondola.cpp:145:14: warning: variable 'flag1' set but not used [-Wunused-but-set-variable]
  145 |         bool flag1 = false, flag2 = false;
      |              ^~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:108:17: warning: 'idx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  108 |         for(int i = idx - 1; i >= 1; i--)
      |                 ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 9 ms 2652 KB Output is correct
7 Correct 25 ms 4876 KB Output is correct
8 Correct 16 ms 4956 KB Output is correct
9 Correct 5 ms 1848 KB Output is correct
10 Correct 22 ms 5576 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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
6 Correct 9 ms 2648 KB Output is correct
7 Correct 21 ms 4956 KB Output is correct
8 Correct 16 ms 4804 KB Output is correct
9 Correct 6 ms 1884 KB Output is correct
10 Correct 21 ms 5716 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 10 ms 2648 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 26 ms 5980 KB Output is correct

Subtask #4
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 344 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 1 ms 344 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 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #6
20.0 / 20.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 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 10 ms 2516 KB Output is correct
12 Correct 12 ms 2772 KB Output is correct
13 Correct 12 ms 1728 KB Output is correct
14 Correct 11 ms 2516 KB Output is correct
15 Correct 19 ms 2388 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
0 / 15.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 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 1 ms 348 KB Integer -841481820 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 444 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 Incorrect 1 ms 348 KB Integer -841481820 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 344 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 Correct 0 ms 448 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Integer -841481820 violates the range [0, 1000000008]
8 Halted 0 ms 0 KB -