제출 #1141223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141223		omtheprogrammer1	Meteors (POI11_met)	C++20	74 / 100	4348 ms	52096 KiB

met

#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define mp make_pair
#define pb push_back
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define ins insert
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define sz(v) (ll)v.size()
#define readgraph(list, edges) for (ll i = 0; i < edges; i++) {ll a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;
typedef vector<ll> vi;
typedef pair<ll, ll> pii;
#define F_OR(i, a, b, s) for (ll i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)

ll prexor(ll i) {
  i++;
  if ((i % 4) == 0) return 0;
  else if ((i % 4) == 1) return i - 1;
  else if ((i % 4) == 2) return 1;
  else return i;
}
ll rangexor(ll l, ll r) {
  if (l == 0) return prexor(r);
  return prexor(r)^prexor(l - 1);
}
ll FIRSTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb) / 2;
    f(mb) ? rb = mb : lb = mb + 1;
  }
  return lb;
}
ll LASTTRUE(function<bool(ll)> f, ll lb, ll rb) {
  while (lb < rb) {
    ll mb = (lb + rb + 1) / 2;
    f(mb) ? lb = mb : rb = mb - 1;
  }
  return lb;
}

template<class A> void read(vector<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(vector<A>& x) {
  EACH(a, x)
  read(a);
}
template<class A, size_t S> void read(array<A, S>& x) {
  EACH(a, x)
  read(a);
}

// #define cerr cout
namespace __DEBUG_UTIL__
{
/* Primitive Datatypes Print */
void print(const char *x) { cerr << x; }
void print(bool x) { cerr << (x ? "T" : "F"); }
void print(char x) { cerr << '\'' << x << '\''; }
void print(signed short int x) { cerr << x; }
void print(unsigned short int x) { cerr << x; }
void print(signed int x) { cerr << x; }
void print(unsigned int x) { cerr << x; }
void print(signed long int x) { cerr << x; }
void print(unsigned long int x) { cerr << x; }
void print(signed long long int x) { cerr << x; }
void print(unsigned long long int x) { cerr << x; }
void print(float x) { cerr << x; }
void print(double x) { cerr << x; }
void print(long double x) { cerr << x; }
void print(string x) { cerr << '\"' << x << '\"'; }
template <size_t N>
void print(bitset<N> x) { cerr << x; }
void print(vector<bool> v)
{ /* Overloaded this because stl optimizes vector<bool> by using
      _Bit_reference instead of bool to conserve space. */
  int f = 0;
  cerr << '{';
  for (auto && i : v)
    cerr << (f++ ? "," : "") << (i ? "T" : "F");
  cerr << "}";
}
/* Templates Declarations to support nested datatypes */
template <typename T>
void print(T &&x);
template <typename T>
void print(vector<vector<T>> mat);
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M]);
template <typename F, typename S>
void print(pair<F, S> x);
template <typename T, size_t N>
struct Tuple;
template <typename T>
struct Tuple<T, 1>;
template <typename... Args>
void print(tuple<Args...> t);
template <typename... T>
void print(priority_queue<T...> pq);
template <typename T>
void print(stack<T> st);
template <typename T>
void print(queue<T> q);
/* Template Datatypes Definitions */
template <typename T>
void print(T &&x)
{
  /*  This works for every container that supports range-based loop
      i.e. vector, set, map, oset, omap, dequeue */
  int f = 0;
  cerr << '{';
  for (auto && i : x)
    cerr << (f++ ? "," : ""), print(i);
  cerr << "}";
}
template <typename T>
void print(vector<vector<T>> mat)
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename T, size_t N, size_t M>
void print(T (&mat)[N][M])
{
  int f = 0;
  cerr << "\n~~~~~\n";
  for (auto && i : mat)
  {
    cerr << setw(2) << left << f++, print(i), cerr << "\n";
  }
  cerr << "~~~~~\n";
}
template <typename F, typename S>
void print(pair<F, S> x)
{
  cerr << '(';
  print(x.first);
  cerr << ',';
  print(x.second);
  cerr << ')';
}
template <typename T, size_t N>
struct Tuple
{
  static void printTuple(T t)
  {
    Tuple < T, N - 1 >::printTuple(t);
    cerr << ",", print(get < N - 1 > (t));
  }
};
template <typename T>
struct Tuple<T, 1>
{
  static void printTuple(T t) { print(get<0>(t)); }
};
template <typename... Args>
void print(tuple<Args...> t)
{
  cerr << "(";
  Tuple<decltype(t), sizeof...(Args)>::printTuple(t);
  cerr << ")";
}
template <typename... T>
void print(priority_queue<T...> pq)
{
  int f = 0;
  cerr << '{';
  while (!pq.empty())
    cerr << (f++ ? "," : ""), print(pq.top()), pq.pop();
  cerr << "}";
}
template <typename T>
void print(stack<T> st)
{
  int f = 0;
  cerr << '{';
  while (!st.empty())
    cerr << (f++ ? "," : ""), print(st.top()), st.pop();
  cerr << "}";
}
template <typename T>
void print(queue<T> q)
{
  int f = 0;
  cerr << '{';
  while (!q.empty())
    cerr << (f++ ? "," : ""), print(q.front()), q.pop();
  cerr << "}";
}
/* Printer functions */
void printer(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printer(const char *names, T &&head, V &&...tail)
{
  /* Using && to capture both lvalues and rvalues */
  int i = 0;
  for (size_t bracket = 0; names[i] != '\0' and (names[i] != ',' or bracket != 0); i++)
    if (names[i] == '(' or names[i] == '<' or names[i] == '{')
      bracket++;
    else if (names[i] == ')' or names[i] == '>' or names[i] == '}')
      bracket--;
  cerr.write(names, i) << " = ";
  print(head);
  if (sizeof...(tail))
    cerr << " ||", printer(names + i + 1, tail...);
  else
    cerr << "]\n";
}
/* PrinterArr */
void printerArr(const char *) {} /* Base Recursive */
template <typename T, typename... V>
void printerArr(const char *names, T arr[], size_t N, V... tail)
{
  size_t ind = 0;
  for (; names[ind] and names[ind] != ','; ind++)
    cerr << names[ind];
  for (ind++; names[ind] and names[ind] != ','; ind++)
    ;
  cerr << " = {";
  for (size_t i = 0; i < N; i++)
    cerr << (i ? "," : ""), print(arr[i]);
  cerr << "}";
  if (sizeof...(tail))
    cerr << " ||", printerArr(names + ind + 1, tail...);
  else
    cerr << "]\n";
}
}

#define debug(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printer(#__VA_ARGS__, __VA_ARGS__);
#define debugArr(...) std::cerr << __LINE__ << ": [", __DEBUG_UTIL__::printerArr(#__VA_ARGS__, __VA_ARGS__);


mt19937 mt_rng(chrono::steady_clock::now().time_since_epoch().count());
ll randint(ll a, ll b) {
  return uniform_int_distribution<ll>(a, b)(mt_rng);
}
/*--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/

const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
const ll INF = 1e17;
const int d4i[4] = { -1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = { -1, -1, 0, 1, 1, 1, 0, -1}, d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int kni[8] = { +2, +2, -2, -2, 1, -1, 1, -1}, knj[8] = {1, -1, 1, -1, 2, 2, -2, -2};

ll n, m, k, q, l, r, x, y, z , h;
const ll tas = 3e5 + 10;
ll a[tas];
ll b[tas];
ll c[tas];
string s, t;
vector<int> grid[tas];
// vector<pii> edges[tas];
ll ans[tas];

ll tree[4 * tas];
ll lazy[4 * tas];

void prop(int i, int l, int r) {
  int mid =  (l + r) / 2;
  ll val = lazy[i];
  tree[2 * i + 1] += (mid - l + 1) * val;
  lazy[2 * i + 1] += val;
  tree[2 * i + 2] += (r - mid) * val;
  lazy[2 * i + 2] += val;
  lazy[i] = 0;
}
void update(int i, int l, int r, int tl, int tr, ll val) {
  if (tl <= l && r <= tr) {
    tree[i] += (r - l + 1) * val;
    lazy[i] += val;
    return;
  }
  if (tr < l || r < tl) {
    return;
  }
  prop(i, l, r);
  int mid = (l + r) / 2;
  update(2 * i + 1, l, mid, tl, tr, val);
  update(2 * i + 2, mid + 1, r, tl, tr, val);
  tree[i] = tree[2 * i + 1] + tree[2 * i + 2];
}
ll query(int i, int l, int r, int tl, int tr, ll val = 0) {
  if (tl <= l && r <= tr) {
    return tree[i];
  }
  if (tr < l || r < tl) {
    return 0;
  }
  prop(i, l, r);
  int mid = (l + r) / 2;
  return query(2 * i + 1, l, mid, tl, tr, val) +
         query(2 * i + 2, mid + 1, r, tl, tr, val);
}

class cl {
public:
  int l, r, val;
};

cl cq[tas];

void dvd(int l, int r, vector<ll> &vec) {
  if (r < l) {
    return;
  }
  if (l == r) {
    for (auto val : vec)ans[val] = l + 1;
    return;
  }
  vector<ll> t1, t2;
  int mid = (l + r) / 2;

  FOR(i, l, mid + 1) {
    if (cq[i].l <= cq[i].r)
      update(0, 0, m - 1, cq[i].l, cq[i].r, cq[i].val);
    else
      update(0, 0, m - 1, cq[i].l, m - 1, cq[i].val),
             update(0, 0, m - 1, 0, cq[i].r, cq[i].val);
  }
  for (auto val : vec) {
    ll temp = b[val];
    for (auto v1 : grid[val]) {
      temp -= query(0, 0, m - 1, v1, v1);
    }
    if (temp > 0)b[val] = temp, t1.pb(val);
    else t2.pb(val);
  }
  FOR(i, l, mid + 1) {
    if (cq[i].l <= cq[i].r)
      update(0, 0, m - 1, cq[i].l, cq[i].r, -cq[i].val);
    else
      update(0, 0, m - 1, cq[i].l, m - 1, -cq[i].val),
             update(0, 0, m - 1, 0, cq[i].r, -cq[i].val);
  }
  // debug(t1, t2, mid)
  dvd(l, mid, t2);
  dvd(mid + 1, r, t1);
}

void solve(int tc = 0) {

  cin >> n >> m;
  FOR(m) {
    cin >> a[i];
    a[i]--;
    grid[a[i]].pb(i);
  }
  map<ll, ll> ma;
  FOR(n) {
    cin >> b[i];
    if (sz(grid[i]) == 0) ma[i] = 0;
  }
  cin >> q;
  FOR(q) cin >> l >> r >> x, cq[i].l = l - 1, cq[i].r = r - 1, cq[i].val = x;
  FOR(i, 0, q) {
    if (cq[i].l <= cq[i].r)
      update(0, 0, m - 1, cq[i].l, cq[i].r, cq[i].val);
    else
      update(0, 0, m - 1, cq[i].l, m - 1, cq[i].val),
             update(0, 0, m - 1, 0, cq[i].r, cq[i].val);
  }
  FOR(val, 0, n) {
    ll temp = b[val];
    for (auto v1 : grid[val]) {
      // debug(v1)b
      temp -= query(0, 0, m - 1, v1, v1);
    }
    ma[val] = (temp <= 0);
    // debug(val, temp)
  }
  FOR(i, 0, q) {
    if (cq[i].l <= cq[i].r)
      update(0, 0, m - 1, cq[i].l, cq[i].r, -cq[i].val);
    else
      update(0, 0, m - 1, cq[i].l, m - 1, -cq[i].val),
             update(0, 0, m - 1, 0, cq[i].r, -cq[i].val);
  }
  vector<ll> vec;
  FOR(n) vec.pb(i);
  dvd(0, q - 1, vec);
  FOR(n) {
    if (ma[i]) {
      cout << ans[i] << endl;
    }
    else cout << "NIE" << endl;
    // debug(i, ma[i])
  }

}

int main() {
  fastio

#ifdef LOCAL
  auto begin = std::chrono::high_resolution_clock::now();
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  freopen("error.txt", "w", stderr);
#endif

  ll tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
#ifdef LOCAL
  auto end = std::chrono::high_resolution_clock::now();
  auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
  // cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
#endif
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 13 / 13
• Subtask 6: 13 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13