제출 #915983

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
915983		xynex	추월 (IOI23_overtaking)	C++17	19 / 100	9 ms	27736 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 = 1e3 + 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*/
/*
6 4 10 7 2
20 10 40 0
5 20 20 30
0 1 2 3 4 5 6
*/
pr<pr<ll, ll>, int> x[M][M];
int poses[M][M];
ll l, vel;
int n, m;
vt<int> arr;
/*
6 5 5 7 2
20 10 40 0 30
5 20 20 30 5
0 1 2 3 4 5 6
0
30

*/
void init(int L, int N, vt<ll> T, vt<int> W, int X, int M, vt<int> S) {
  l = L;
  n = N, m = M;
  arr = S;
  vel = X;
  for(int i = 0; i < N; ++i) {
    x[0][i] = {{T[i], W[i]}, i};
  }
  sort(x[0], x[0] + N);
  for(int i = 1; i < M; ++i) {
    ll ost = S[i] - S[i - 1];
    for(int j = 0; j < N; ++j) x[i][j] = {{x[i - 1][j].ff.ff + ost * 1ll * x[i - 1][j].ff.ss, x[i - 1][j].ff.ss}, x[i - 1][j].ss};
    for(int j = 1; j < N; ++j) x[i][j].ff.ff = max(x[i][j].ff.ff, x[i][j - 1].ff.ff);
    sort(x[i], x[i] + N);
    for(int j = 0; j < N; ++j) {
      poses[i][x[i][j].ss] = j;
    }
  }
  /*for(int i = 0; i < M; ++i) {
    for(int j = 0; j < N; ++j) print(x[i][j].ff.ff, x[i][j].ff.ss, x[i][j].ss);
    print("");
  }*/
}
ll arrival_time(ll num) {
  ll mx = 0;
  vt<pr<ll, int>> ord;
  ll res = vel * 1ll * l + num;
  int pos = 0;
  for(int i = n - 1; i >= 0; --i) {
    res = max({res, num + (l - mx) * 1ll * vel});
    if(x[pos][i].ff.ff > num) {
        continue;
    }
   // print(x[pos][i].ff.ff, x[pos][i].ff.ss);
    if(x[pos][i].ff.ss > vel) {
      ll mn = (max(0ll, num - x[pos][i].ff.ff) + (x[pos][i].ff.ss) - vel - 1) / (x[pos][i].ff.ss - vel);
      //print(mn);
      int MX = mx;
      int pos1 = pos;
      if(mx + mn > l) {
        res = max({res, x[m - 1][poses[m - 1][x[pos][i].ss]].ff.ff, num + (l - mx) * 1ll * vel});
        pos = m - 1;
        mx = arr[pos];
        continue;
      }
      mx += mn;
      mx = min(mx, l);
      while(arr[pos] < mx) pos++;
      mx = arr[pos];
      //print(num, i, mx, mn, pos, arr[pos], poses[pos][x[pos1][i].ss], x[pos][poses[pos][x[pos1][i].ss]].ff.ff);
      ll cur = max(x[pos][poses[pos][x[pos1][i].ss]].ff.ff, num + (mx - MX) * 1ll * vel);
      res = max(res, cur + (l - mx) * 1ll * vel);
      num = max(cur, num);
      if(mx == MX) continue;
      //print(num);
    }
  }
  num += (l - arr[pos]) * 1ll * vel;
  return res;
}

/*
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //freop("");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}*/

컴파일 시 표준 에러 (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: 0 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35