Submission #237712

# Submission time Handle Problem Language Result Execution time Memory
237712 2020-06-08T12:26:23 Z zaneyu Gondola (IOI14_gondola) C++14
55 / 100
30 ms 4608 KB
/*input
10
4
4 7 4 7

*/
#include "gondola.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<double,double>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const int maxn=1e5+5;
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int valid(int n, int arr[]){
  if(n==1){
    return 1;
  }
  int pv=arr[0];
  int st=0;
  while(st<n and pv>n){
    pv=arr[st];
    ++st;
  }
  if(st==n){
    vector<int> v;
    REP(i,n) v.pb(arr[i]);
    int x=sz(v);
    SORT_UNIQUE(v);
    if(sz(v)==x) return 1;
    return 0;
  }
  int i=(st+1)%n;
  set<int> s;
  s.insert(pv);
  while(i!=st){
    pv++;
    if(pv==n+1) pv=1;
    if(arr[i]<=n){
    if(arr[i]!=pv){
      return 0;
    }
    }
    s.insert(arr[i]);
    i++;
    i%=n;
  }
  if(sz(s)!=n) return 0;
  return 1;
}

//----------------------
int supposed[maxn];
int replacement(int n, int arr[], int ans[])
{
  int pv=arr[0];
  int st=1;
  while(st<n and pv>n){
    pv=arr[st];
    ++st;
  }
  vector<pii> v;
  if(st==n){
    v.pb({arr[0],1});
    pv=1;
    st=1;
  }
  --st;
  st+=n;
  st%=n;
  int i=(st+1)%n;
  while(i!=st){
    pv++;
    if(pv==n+1) pv=1;
    //cout<<i<<' '<<pv<<'\n';
    if(arr[i]!=pv){
      v.pb({arr[i],pv});
    }
    i++;
    i%=n;
  }
  sort(ALL(v));
  int ptr=0;
  int cur=n+1;
  REP(j,sz(v)){
    ans[ptr++]=v[j].s;
    while(cur<v[j].f){
      ans[ptr++]=cur++;
    }
    ++cur;
  }
  return ptr;
}

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

int countReplacement(int n, int arr[])
{
  if(!valid(n,arr)){
    return 0;
  }
  vector<int> v;
  REP(i,n){
    if(arr[i]>n) v.pb(arr[i]);
  }
  sort(ALL(v));
  ll ans=1;
  int pv=n;
  REP(i,sz(v)){
    ans=mult(ans,mypow(sz(v)-i,v[i]-pv-1));
    pv=v[i];
  }
  if(sz(v)==n) ans=mult(ans,n);
  return (int)ans;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 15 ms 2176 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 27 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 30 ms 4600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 16 ms 640 KB Output is correct
8 Correct 26 ms 3968 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 30 ms 4608 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 9 ms 512 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 16 ms 640 KB Output is correct
# 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 5 ms 512 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
# 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 5 ms 384 KB Output is correct
4 Correct 4 ms 256 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 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 512 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 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 14 ms 640 KB Output is correct
12 Correct 16 ms 640 KB Output is correct
13 Correct 20 ms 1400 KB Output is correct
14 Correct 14 ms 640 KB Output is correct
15 Correct 26 ms 2288 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -