| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 893927 |
2023-12-27T17:08:58 Z |
vjudge1 |
Meteors (POI11_met) |
C++17 |
|
914 ms |
62144 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(5e5)+100;
const long long inf = 2e18;
const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
ll n, m, o[N], need[N], k, ql[N], qr[N], qa[N], bl[N], br[N];
ll f[N];
vector<int> check[N];
vector<int> pos[N];
void update(ll p, ll x) {
while(p <= m) {
if(f[p] < 1e12) f[p] += x;
p += (p & -p);
}
}
ll get(int p, ll ned) {
ll res = 0;
while(p > 0) {
res += f[p];
if(res >= ned) break;
p -= (p & -p);
}
return res;
}
void Baizho() {
cin>>n>>m;
for(int i = 1; i <= m; i ++) {
cin>>o[i];
pos[o[i]].pb(i);
}
for(int i = 1; i <= n; i ++) cin>>need[i];
cin>>k;
for(int i = 1; i <= k; i ++) cin>>ql[i]>>qr[i]>>qa[i];
for(int i = 1; i <= n; i ++) {
bl[i] = 1, br[i] = k + 1;
}
for(int bin = 0; bin <= 30; bin ++) {
for(int j = 0; j <= m; j ++) {
f[j] = 0;
}
bool ok = 0;
for(int i = 1; i <= n; i ++) {
if(bl[i] < br[i]) {
check[(bl[i] + br[i]) / 2].pb(i);
ok = 1;
}
}
if(!ok) break;
for(int i = 1; i <= k; i ++) {
if(ql[i] > qr[i]) {
// cout<<ql[i]<<" "<<qa[i]<<" "<<get(ql[i])<<"\n";
update(qr[i] + 1, -qa[i]);
update(1, qa[i]);
update(ql[i], qa[i]);
} else {
update(qr[i] + 1, -qa[i]);
update(ql[i], qa[i]);
}
for(auto j : check[i]) {
ll res = 0;
// cout<<j<<" "<<i<<"\n";
for(auto p : pos[j]) {
// cout<<p<<" "<<get(p)<<"\n";
res += get(p, need[j]);
if(res >= need[j]) break;
}
// cout<<res<<"\n";
if(need[j] <= res) br[j] = i;
else bl[j] = i + 1;
}
check[i].clear();
}
}
for(int i = 1; i <= n; i ++) {
if(bl[i] > k) cout<<"NIE\n";
else cout<<bl[i]<<"\n";
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
met.cpp: In function 'void Freopen(std::string)':
met.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
39512 KB |
Output is correct |
| 2 |
Correct |
8 ms |
39516 KB |
Output is correct |
| 3 |
Correct |
8 ms |
39660 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
39516 KB |
Output is correct |
| 2 |
Correct |
8 ms |
39516 KB |
Output is correct |
| 3 |
Correct |
8 ms |
39516 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
44372 KB |
Output is correct |
| 2 |
Correct |
91 ms |
46124 KB |
Output is correct |
| 3 |
Correct |
85 ms |
45940 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
82 ms |
45396 KB |
Output is correct |
| 2 |
Correct |
84 ms |
45312 KB |
Output is correct |
| 3 |
Correct |
94 ms |
46164 KB |
Output is correct |
| 4 |
Correct |
29 ms |
43100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
61 ms |
44664 KB |
Output is correct |
| 2 |
Correct |
71 ms |
46684 KB |
Output is correct |
| 3 |
Correct |
44 ms |
43608 KB |
Output is correct |
| 4 |
Correct |
79 ms |
46100 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
77 ms |
44052 KB |
Output is correct |
| 2 |
Correct |
81 ms |
45280 KB |
Output is correct |
| 3 |
Correct |
62 ms |
44256 KB |
Output is correct |
| 4 |
Correct |
97 ms |
47440 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
914 ms |
62144 KB |
Output is correct |
| 2 |
Incorrect |
540 ms |
48992 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
899 ms |
61076 KB |
Output is correct |
| 2 |
Incorrect |
545 ms |
49112 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
