oj.uz

Submission #202789

# Submission time Handle Problem Language Result Execution time Memory
202789 2020-02-17T23:02:26 Z galen_colin Gondola (IOI14_gondola) C++14
100 / 100
 84 ms 6744 KB 
#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); a++)
#define f1r(a, b, c) for (long long a = (b); a < (c); a++)
#define f0rd(a, b) for (long long a = (b); a >= 0; a--)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define io {ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < n; ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = lb; ele <= rb; ele++) { if (ele > lb) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// template<typename A, typename B> ll max(A x, B y) {
//   return x > y ? x : y;
// }
// template<typename A, typename B> ll min(A x, B y) {
//   return x < y ? x : y;
// }
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;

// namespace interactor {
  
// }

// using namespace interactor;

// int valid(int n, int seq[]);
// int replacement(int n, int seq[], int replace[]);
// int countReplacement(int n, int seq[]);

// int main() {
//   int a[5] = {8, 2, 13624735, 4, 999};
//   int b[5] = {2, 3, 4, 5, 6};
//   int c[4] = {1, 7, 6, 5};
//   int d[7] = {2, 3, 4, 9, 6, 7, 1};
//   int e[3] = {1, 6, 5};
//   cout << countReplacement(3, e) << endl;
// }

#include "gondola.h"
 
ll n, m, k, q, Q, T, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

map<int, int> freq;

int valid(int n, int seq[]) {
  int oseq[n];
  f0r(i, n) oseq[i] = seq[i] - 1;
  f0r(i, n) {
    ++freq[oseq[i]];
    if (freq[oseq[i]] > 1) return 0;
  }
  f0r(i, n) {
    if (oseq[i] < n) {
      f0r(j, n) {
        if (oseq[(i + j) % n] < n && oseq[(i + j) % n] != (oseq[i] + j) % n) return 0;
      }
      break;
    }
  }

  return 1;
}

int loc[250005];
int sseq[100005];

int replacement(int n, int seq[], int replace[]) {
  f0r(i, n) --seq[i];
  f0r(i, n) sseq[i] = seq[i];
  sort(sseq, sseq + n);

  int rind = 0;

  int mx = 0;

  f0r(i, n) mx = max(mx, seq[i]);
  f0r(i, mx) loc[i] = -1;
  f0r(i, n) loc[seq[i]] = i;

  int sent = seq[loc[mx]];

  bool whatever = 1;

  f0r(i, n) {
    if (loc[i] != -1) {
      f0r(j, n) seq[(loc[i] + j) % n] = (i + j) % n;
      whatever = 0;
      break;
    }
  }

  if (whatever) f0r(i, n) seq[i] = i;

  f0r(i, n) {
    while (n + rind <= sseq[i]) {
      replace[rind] = seq[loc[sseq[i]]] + 1;
      seq[loc[sseq[i]]] = n + rind++;
    }
  }

  return rind;
}

ll mpow(ll base, ll exp) {
  const ll mod = 1000000009;
  ll r = 1;
  while (exp) {
    if (exp & 1) {
      r = (r * base) % mod;
    }
    base = (base * base) % mod;
    exp >>= 1;
  }
  return r;
}

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

  const ll mod = 1000000009;
  f0r(i, n) --seq[i];
  f0r(i, n) sseq[i] = seq[i];
  sort(sseq, sseq + n);

  int mx = 0;

  bool whatever = 1;

  f0r(i, n) {
    if (seq[i] < n) whatever = 0;
  }

  ll ans = 1;
  if (whatever) ans = (ans * n) % mod;
  
  int rind = n - 1;
  f0r(i, n) {
    ll v = sseq[i] - rind - 1;
    rind = max(rind, sseq[i]);
    if (v > 0) ans = (ans * mpow(n - i, v)) % mod;
  }

  return ans;
}
 
// int main() {
//   io;
//   // freopen("case", "r", stdin);
//   // freopen("test.txt", "r", stdin);
//   // freopen("case", "w", stdout);
//   // freopen("file.in", "r", stdin);
 
//   // usaco("file");
 
  
// }

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:138:7: warning: unused variable 'sent' [-Wunused-variable]
   int sent = seq[loc[mx]];
       ^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:183:7: warning: unused variable 'mx' [-Wunused-variable]
   int mx = 0;
       ^~
gondola.cpp: In function 'void usaco(std::__cxx11::string)':
gondola.cpp:65:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".in").c_str(), "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gondola.cpp:66:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen((filename + ".out").c_str(), "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 23 ms 2424 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 36 ms 4296 KB Output is correct
9 Correct 14 ms 1528 KB Output is correct
10 Correct 42 ms 4856 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 19 ms 2424 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 32 ms 4216 KB Output is correct
9 Correct 13 ms 1528 KB Output is correct
10 Correct 39 ms 4856 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 24 ms 2296 KB Output is correct
14 Correct 5 ms 508 KB Output is correct
15 Correct 54 ms 5112 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 19 ms 1272 KB Output is correct
12 Correct 21 ms 1400 KB Output is correct
13 Correct 22 ms 1784 KB Output is correct
14 Correct 18 ms 1272 KB Output is correct
15 Correct 28 ms 2936 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 372 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 54 ms 5112 KB Output is correct
10 Correct 44 ms 4344 KB Output is correct
11 Correct 18 ms 1784 KB Output is correct
12 Correct 22 ms 2168 KB Output is correct
13 Correct 8 ms 760 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 54 ms 5112 KB Output is correct
10 Correct 45 ms 4344 KB Output is correct
11 Correct 18 ms 1784 KB Output is correct
12 Correct 22 ms 2168 KB Output is correct
13 Correct 8 ms 760 KB Output is correct
14 Correct 67 ms 6008 KB Output is correct
15 Correct 84 ms 6744 KB Output is correct
16 Correct 15 ms 1528 KB Output is correct
17 Correct 48 ms 4728 KB Output is correct
18 Correct 30 ms 2808 KB Output is correct