제출 #202721

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202721		galen_colin	휴가 (IOI14_holiday)	C++14	30 / 100	5058 ms	27000 KiB

holiday

#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;

struct kthSeg {
  vector<int> on;
  vector<ll> vals;

  void init(int n) {
    on = vector<int>(4 * n, 0);
    vals = vector<ll>(4 * n, 0);
  }

  pair<int, ll> update(int i, int tl, int tr, int loc, int val) {
    if (loc < tl || loc > tr) return mp(on[i], vals[i]);

    if (tl == tr) {
      on[i] = 1;
      vals[i] = val;
      return mp(1, val);
    }

    int mid = (tl + tr) / 2;
    pair<int, ll> a = update(2 * i + 1, tl, mid, loc, val);
    pair<int, ll> b = update(2 * i + 2, mid + 1, tr, loc, val);
    on[i] = a.f + b.f;
    vals[i] = a.s + b.s;
    return mp(a.f + b.f, a.s + b.s);
  }

  pair<int, ll> getK(int i, int tl, int tr, int k) {
    if (tl == tr) {
      if (k == 0) return mp(0, 0);
      return mp(on[i], vals[i]);
    }

    if (k >= on[i]) return mp(on[i], vals[i]);

    int mid = (tl + tr) / 2;
    pair<int, ll> a = getK(2 * i + 1, tl, mid, k);
    if (a.f < k) {
      pair<int, ll> b = getK(2 * i + 2, mid + 1, tr, k - a.f);
      return mp(a.f + b.f, a.s + b.s);
    }
    return a;
  }
};

// namespace interactor {
  
// }

// using namespace interactor;

// ll findMaxAttraction(int n, int start, int d, int att[]);

// int main() {
//   int d = 4;
//   int att[4] = {10000, 2, 3, 100};
//   cout << findMaxAttraction(4, 2, d, att) << endl;
// }

#include "holiday.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;

pair<ll, int> asort[100005];
kthSeg st;
map<pair<ll, int>, int> locs;
ll lbest[8005], lrev[8005];

ll findMaxAttraction(int n, int start, int d, int att[]) {
  if (start == 0) {
    f0r(i, n) {
      asort[i].f = att[i];
      asort[i].s = i;
    }
    sort(asort, asort + n);
    f0r(i, n) locs[asort[i]] = n - 1 - i;

    st.init(n);

    ll mx = 0;
    f0r(i, n) {
      st.update(0, 0, n - 1, locs[mp(att[i], i)], att[i]);
      mx = max(mx, st.getK(0, 0, n - 1, d).s);
      --d;
    }
    return mx;
  } else {
    f0r(i, n) {
      asort[i].f = att[i];
      asort[i].s = i;
    }
    sort(asort, asort + n);
    f0r(i, n) locs[asort[i]] = n - 1 - i;

    ms(lbest, 0);
    ms(lrev, 0);

    st.init(n);

    ll ans = 0;

    f0rd(i, start - 1) {
      st.update(0, 0, n - 1, locs[mp(att[i], i)], att[i]);

      ll dist;
      ll num = dist = start - i;
      ll v = st.getK(0, 0, n - 1, num).s;
      f0r(j, n) {
        if (j + dist > d) break;
        ll o;
        if (j >= num) o = v;
        else o = st.getK(0, 0, n - 1, j).s;
        ans = max(ans, o);
        lbest[j + dist] = o;
        lrev[j + 2 * dist] = o;
      }
    }

    st.init(n);

    f1r(i, start, n) {
      st.update(0, 0, n - 1, locs[mp(att[i], i)], att[i]);
      ll dist = i - start;
      ll num = i - start + 1;
      ll v = st.getK(0, 0, n - 1, num).s;
      ll mxv = 0;
      ll mrxv = 0;
      f0r(j, n + 1) {
        if (j + dist > d) break;
        ll o;
        if (j >= num) o = v;
        else o = st.getK(0, 0, n - 1, j).s;
        ll mx = 0;
        f0r(m, d - j - dist + 1) mx = max(mx, lrev[m]);
        f0r(m, d - j - 2 * dist + 1) mx = max(mx, lbest[m]);
        // cout << o << " " << mx << " " << dist << " " << j << endl;
        ans = max(ans, o + mx);
      }
    }

    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");
 
  
// } 

컴파일 시 표준 에러 (stderr) 메시지

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:202:10: warning: unused variable 'mxv' [-Wunused-variable]
       ll mxv = 0;
          ^~~
holiday.cpp:203:10: warning: unused variable 'mrxv' [-Wunused-variable]
       ll mrxv = 0;
          ^~~~
holiday.cpp: In function 'void usaco(std::__cxx11::string)':
holiday.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);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
holiday.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: 7 / 7
• Subtask 2: 23 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53