| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 497939 |
2021-12-24T05:11:28 Z |
xynex |
Meteors (POI11_met) |
C++17 |
|
1451 ms |
49692 KB |
/*
* Author: xynex
* Created: 24.12.2021 09:51
* 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 int N = 3e5 + 5;
const ll INF = 9e18;
const int M = 3e3 + 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*/
void precalc() {
}
int n, m, q;
vt<ll> whr[N];
ll need[N], x[N], y[N], ind[N], sum[2 * N], ans[N], a[N];
void upd(int l, int r, ll ind, int tl = 1, int tr = N, int v = 1) {
l += N, r += N;
sum[l] += ind;
if(l != r) sum[r] += ind;
while((r - l) > 1) {
if(l % 2 == 0) sum[l + 1] += ind;
if(r % 2 == 1) sum[r - 1] += ind;
l /= 2;
r /= 2;
}
}
ll get(int pos) {
ll res = 0;
for(int i = N + pos; i >= 1; i /= 2) res += sum[i];
return res;
}
void upd(int pos, ll val) {
ll num = ind[pos] * val;
// print(num, x[pos], y[pos]);
if(x[pos] > y[pos]) upd(x[pos], N - 1, num), upd(0, y[pos], num);
else upd(x[pos], y[pos], num);
}
void go(int l, int r, vt<ll> &peop, int &pos) {
if(peop.empty()) return;
//print(l, r, peop);
int mid = (l + r) >> 1;
if(pos < mid) {
while(pos < mid) {
upd(++pos, 1);
}
}
else {
while(pos > mid) {
upd(pos--, -1);
}
}
vt<ll> L, R;
for(auto p : peop) {
ll cnt = 0;
for(auto tut : whr[p]) {
cnt += get(tut);
if(cnt >= need[p]) {
break;
}
}
if(cnt < need[p]) R.pb(p);
else {
L.pb(p);
ans[p] = r;
}
}
peop.clear();
if(l < r) {
go(l, mid, L, pos);
go(mid + 1, r, R, pos);
}
}
void solve() {
read(n, m);
for(int i = 1; i <= m; ++i) {
read(a[i]);
whr[a[i]].pb(i);
}
for(int i = 1; i <= n; ++i) {
read(need[i]);
}
read(q);
for(int i = 1; i <= q; ++i) {
read(x[i], y[i], ind[i]);
}
vt<ll> peop;
for(int i = 1; i <= n; ++i) peop.pb(i);
int W = 0;
go(1, q, peop, W);
for(int i = 1; i <= n; ++i) {
if(!ans[i]) print("NIE");
else print(ans[i]);
}
}
int main() {
//freop("");
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
//read(t);
precalc();
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
Compilation message
met.cpp: In function 'void freop(std::string)':
met.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
73 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
74 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
7500 KB |
Output is correct |
| 2 |
Correct |
5 ms |
7500 KB |
Output is correct |
| 3 |
Correct |
4 ms |
7500 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
7500 KB |
Output is correct |
| 2 |
Correct |
4 ms |
7500 KB |
Output is correct |
| 3 |
Correct |
5 ms |
7500 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
11192 KB |
Output is correct |
| 2 |
Correct |
116 ms |
14448 KB |
Output is correct |
| 3 |
Correct |
117 ms |
11236 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
11016 KB |
Output is correct |
| 2 |
Correct |
104 ms |
10920 KB |
Output is correct |
| 3 |
Correct |
78 ms |
13180 KB |
Output is correct |
| 4 |
Correct |
29 ms |
10892 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
54 ms |
10792 KB |
Output is correct |
| 2 |
Correct |
83 ms |
13436 KB |
Output is correct |
| 3 |
Correct |
28 ms |
8652 KB |
Output is correct |
| 4 |
Correct |
110 ms |
11404 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
49 ms |
10316 KB |
Output is correct |
| 2 |
Correct |
103 ms |
10932 KB |
Output is correct |
| 3 |
Correct |
69 ms |
10532 KB |
Output is correct |
| 4 |
Correct |
123 ms |
12548 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
653 ms |
39032 KB |
Output is correct |
| 2 |
Correct |
137 ms |
29372 KB |
Output is correct |
| 3 |
Correct |
155 ms |
15712 KB |
Output is correct |
| 4 |
Correct |
1294 ms |
46076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
651 ms |
35468 KB |
Output is correct |
| 2 |
Correct |
191 ms |
29124 KB |
Output is correct |
| 3 |
Correct |
76 ms |
15564 KB |
Output is correct |
| 4 |
Correct |
1451 ms |
49692 KB |
Output is correct |
