Submission #933857

#	Time	Username	Problem	Language	Result	Execution time	Memory
933857		xynex	Overtaking (IOI23_overtaking)	C++17	65 / 100	3534 ms	41028 KiB

overtaking

/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A>  void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 2e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

const int N = 1e3 + 5;

vt<pr<ll, ll>> a[N];
ll X;
int n_, m_;
vt<int> st_;
void init(int l, int n, vt<ll> arr, vt<int> vel, int x, int m, vt<int> st) {
  X = x;
  m_ = m;
  st_= st;
  for(int i = 0; i < n; ++i) {
    if(vel[i] <= x) continue;
    a[0].push_back({arr[i], vel[i]});
  }
  //a[0].push_back({50, x});
  n = sz(a[0]);
  n_ = n;
  sort(all(a[0]));
  for(int i = 1; i < m; ++i) {
    ll ost = st[i] - st[i - 1];
    for(int j = 0; j < n; ++j) {
      a[i].push_back({a[i - 1][j].ff + ost * 1ll * a[i - 1][j].ss, a[i - 1][j].ss});
    }
    for(int j = 1; j < n; ++j) {
      a[i][j].ff = max(a[i][j].ff, a[i][j - 1].ff);
    }
    sort(all(a[i]));
  }
  /*for(int i = 0; i < m; ++i) {
    for(int j = 0; j < n; ++j) print(a[i][j].ff, a[i][j].ss);
    print("");
  }*/
}
ll arrival_time(ll cur) {
  int pos = n_ - 1;
  for(int i = 0; i < n_; ++i) {
    if(a[0][i].ff < cur) continue;
    pos = i - 1;
    break;
  }
  for(int i = 1; i < m_; ++i) {
    cur += X * 1ll * (st_[i] - st_[i - 1]);
    while(pos >= 0 && cur <= a[i][pos].ff) {
      cur = a[i][pos].ff;
      pos--;
    }
  }
  return cur;
}

Compilation message (stderr)

overtaking.cpp: In function 'void freop(std::string)':
overtaking.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
overtaking.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 26 / 26
• Subtask 5: 0 / 35