Submission #696893

# Submission time Handle Problem Language Result Execution time Memory
696893 2023-02-07T14:33:04 Z n0sk1ll Gondola (IOI14_gondola) C++14
100 / 100
44 ms 6092 KB
#include <bits/stdc++.h>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
#define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
#define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--)
#define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
//const int mod = 1000000007;







//Note to self: Check for overflow

#include "gondola.h"

const int mod=1'000'000'009;

int valid(int n, int a[])
{
    set<int> gondola;
    ff(i,0,n) gondola.insert(a[i]);
    if ((int)gondola.size()!=n) return 0;

    set<int> ost;
    ff(i,0,n) if (a[i]<=n) ost.insert((a[i]+n-i)%n);
    return ((int)ost.size()<=1);

}

int gdet[356256];
int gdea[356256];
int og[300005];

int replacement(int n, int a[], int ans[])
{
    ff(i,0,n) og[i]=a[i];
    int p=0;
    while (p<n && a[p]>n) p++;
    if (p!=n)
    {
        ff(i,p+1,n) og[i]=(og[i-1]+1)%n;
        ff(i,0,p) og[i]=(og[(i+n-1)%n]+1)%n;
    }
    else
    {
        ff(i,0,n) og[i]=i+1;
    }

    ff(i,0,n) if (og[i]==0) og[i]=n;
    ff(i,0,n-1) if (og[i]==n && og[i+1]==n)
    {
        ff(j,0,n) og[j]=j+1;
        break;
    }

    fff(i,0,350001) gdea[i]=-1,gdet[i]=-1;
    ff(i,0,n) gdet[og[i]]=i;
    ff(i,0,n) gdea[a[i]]=i;

    int k=0;
    bfff(i,0,350000) if (gdea[i]==-1) gdea[i]=gdea[i+1];
    fff(i,n+1,350000) if (gdea[i]!=-1) ans[k++]=og[gdea[i]],og[gdea[i]]=i; else break;

    return k;
}

int power(int a, int n)
{
    li c=1;
    while (n)
    {
        if (n&1) (c*=a)%=mod;
        a=(li)a*a%mod,n>>=1;
    }
    return c;
}

int countReplacement(int n, int a[])
{
    if (!valid(n,a)) return 0;

    vector<int> add;
    ff(i,0,n) if (a[i]>n) add.pb(a[i]);
    sort(all(add));

    //for (auto it : add) cout<<it<<" "; cout<<endl;

    if (add.empty()) return 1;
    li ans=power((int)add.size(),add[0]-n-1);
    ff(i,1,(int)add.size()) (ans*=power((int)add.size()-i,add[i]-add[i-1]-1))%=mod;

    if ((int)add.size()==n) (ans*=n)%=mod;
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:44:5: note: in expansion of macro 'ff'
   44 |     ff(i,0,n) gondola.insert(a[i]);
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:48:5: note: in expansion of macro 'ff'
   48 |     ff(i,0,n) if (a[i]<=n) ost.insert((a[i]+n-i)%n);
      |     ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:59:5: note: in expansion of macro 'ff'
   59 |     ff(i,0,n) og[i]=a[i];
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:64:9: note: in expansion of macro 'ff'
   64 |         ff(i,p+1,n) og[i]=(og[i-1]+1)%n;
      |         ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:65:9: note: in expansion of macro 'ff'
   65 |         ff(i,0,p) og[i]=(og[(i+n-1)%n]+1)%n;
      |         ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:69:9: note: in expansion of macro 'ff'
   69 |         ff(i,0,n) og[i]=i+1;
      |         ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:72:5: note: in expansion of macro 'ff'
   72 |     ff(i,0,n) if (og[i]==0) og[i]=n;
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:73:5: note: in expansion of macro 'ff'
   73 |     ff(i,0,n-1) if (og[i]==n && og[i+1]==n)
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:75:9: note: in expansion of macro 'ff'
   75 |         ff(j,0,n) og[j]=j+1;
      |         ^~
gondola.cpp:13:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
gondola.cpp:79:5: note: in expansion of macro 'fff'
   79 |     fff(i,0,350001) gdea[i]=-1,gdet[i]=-1;
      |     ^~~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:80:5: note: in expansion of macro 'ff'
   80 |     ff(i,0,n) gdet[og[i]]=i;
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:81:5: note: in expansion of macro 'ff'
   81 |     ff(i,0,n) gdea[a[i]]=i;
      |     ^~
gondola.cpp:15:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)
      |                              ^
gondola.cpp:84:5: note: in expansion of macro 'bfff'
   84 |     bfff(i,0,350000) if (gdea[i]==-1) gdea[i]=gdea[i+1];
      |     ^~~~
gondola.cpp:13:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   13 | #define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
      |                             ^
gondola.cpp:85:5: note: in expansion of macro 'fff'
   85 |     fff(i,n+1,350000) if (gdea[i]!=-1) ans[k++]=og[gdea[i]],og[gdea[i]]=i; else break;
      |     ^~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:106:5: note: in expansion of macro 'ff'
  106 |     ff(i,0,n) if (a[i]>n) add.pb(a[i]);
      |     ^~
gondola.cpp:12:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
gondola.cpp:113:5: note: in expansion of macro 'ff'
  113 |     ff(i,1,(int)add.size()) (ans*=power((int)add.size()-i,add[i]-add[i-1]-1))%=mod;
      |     ^~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2192 KB Output is correct
7 Correct 24 ms 3608 KB Output is correct
8 Correct 19 ms 3888 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 27 ms 4520 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 10 ms 2132 KB Output is correct
7 Correct 23 ms 3680 KB Output is correct
8 Correct 22 ms 3920 KB Output is correct
9 Correct 6 ms 1416 KB Output is correct
10 Correct 23 ms 4548 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 12 ms 2024 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 41 ms 6092 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3056 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 3 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 2 ms 3028 KB Output is correct
6 Correct 2 ms 3028 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 4 ms 3028 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3028 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 2 ms 3028 KB Output is correct
5 Correct 3 ms 3028 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct
7 Correct 3 ms 3028 KB Output is correct
8 Correct 3 ms 3028 KB Output is correct
9 Correct 3 ms 3028 KB Output is correct
10 Correct 3 ms 3028 KB Output is correct
11 Correct 10 ms 3640 KB Output is correct
12 Correct 12 ms 3656 KB Output is correct
13 Correct 12 ms 3924 KB Output is correct
14 Correct 10 ms 3668 KB Output is correct
15 Correct 19 ms 4856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 35 ms 3944 KB Output is correct
10 Correct 24 ms 3284 KB Output is correct
11 Correct 10 ms 1396 KB Output is correct
12 Correct 15 ms 1620 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 31 ms 3924 KB Output is correct
10 Correct 25 ms 3284 KB Output is correct
11 Correct 9 ms 1364 KB Output is correct
12 Correct 13 ms 1580 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 41 ms 5308 KB Output is correct
15 Correct 44 ms 5908 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 28 ms 4052 KB Output is correct
18 Correct 15 ms 2388 KB Output is correct