oj.uz

Submission #890345

# Submission time Handle Problem Language Result Execution time Memory
890345 2023-12-21T04:06:00 Z vjudge1 Meteors (POI11_met) C++17
74 / 100
 6000 ms 8284 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

//#pragma GCC optimization("g", on)
//#pragma GCC optimization("03")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#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")

#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz(a) int(a.size())
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define setp(a) cout << fixed; cout << setprecision(a)
#define all(v) v.begin(), v.end()
 
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
    long long,
    null_type,
    less_equal<long long>,
    rb_tree_tag,
    tree_order_statistics_node_update> orset;

void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bm(ll x, ll y, ll z) { ll res = 0; while (y) { if (y & 1) (res += x) %= z; (x += x) %= z; y >>= 1; } return res; }
ll bp(ll x, ll y, ll z) { ll res = 1; x %= z; while (y) { if (y & 1) { (res *= x) %= z; y--; } (x *= x) %= z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }

const ll N = 3e5 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
ll n, m, a[N], b[N];
ll ans[N], cnt[N];

void solve() {
	cin >> n >> m;
	for (int i = 1;i <= m;i++) cin >> a[i], ans[i] = inf;
	for (int i = 1;i <= n;i++) cin >> b[i];
	ll k; cin >> k;
	for (ll j = 1;j <= k;j++) {
		ll l, r, x; cin >> l >> r >> x;
		if (l > r) {
			for (int i = l;i <= m;i++) {
				cnt[a[i]] += x;
				if (cnt[a[i]] >= b[a[i]]) {
					ans[a[i]] = min(ans[a[i]], j);
				}
			}
			for (int i = 1;i <= r;i++) {
				cnt[a[i]] += x;
				if (cnt[a[i]] >= b[a[i]]) {
					ans[a[i]] = min(ans[a[i]], j);
				}
			}
		} else {
			for (int i = l;i <= r;i++) {
				cnt[a[i]] += x;
				if (cnt[a[i]] >= b[a[i]]) {
					ans[a[i]] = min(ans[a[i]], j);
				}
			}
		}
	}
	for (int i = 1;i <= n;i++) {
		if (ans[i] == inf) cout << "NIE" << en;
		else cout << ans[i] << en;
	}
}  
   
int main() {      
    aboba    
//    freopen("haircut"); 
//    precalc();
//    cin >> tt;
    for (int i = 1;i <= tt;i++) {			
		solve();
    }
}

Compilation message

met.cpp: In function 'void freopen(std::string)':
met.cpp:47:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:47:75: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 | void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
      |                                                                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1902 ms 6596 KB Output is correct
2 Correct 2632 ms 6744 KB Output is correct
3 Correct 2434 ms 6696 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1247 ms 6676 KB Output is correct
2 Correct 1804 ms 6672 KB Output is correct
3 Correct 4134 ms 6800 KB Output is correct
4 Correct 8 ms 6748 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1949 ms 6880 KB Output is correct
2 Correct 2590 ms 6796 KB Output is correct
3 Correct 25 ms 6488 KB Output is correct
4 Correct 1672 ms 6748 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3540 ms 6740 KB Output is correct
2 Correct 4971 ms 6676 KB Output is correct
3 Correct 1197 ms 6736 KB Output is correct
4 Correct 4160 ms 6804 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6044 ms 8284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6066 ms 8284 KB Time limit exceeded
2 Halted 0 ms 0 KB -