oj.uz

Submission #488945

# Submission time Handle Problem Language Result Execution time Memory
488945 2021-11-20T20:13:42 Z MilosMilutinovic Meteors (POI11_met) C++14
74 / 100
 3104 ms 51752 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
const ll mod2=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=301000;
int n,m,q,o[N],p[N],l[N],r[N],a[N],up[N],lo[N],ok[N];
ll tot[N];
VI qv[N],qs[N];

struct ds {
	ll c[N];
	ds() {
		rep(i,0,N) c[i]=0;
	}
	void modify(int x,int y) {
		for (;x<N;x+=x&-x) c[x]+=y;
	}
	ll query(int x) {
		ll s=0;
		for (;x;x-=x&-x) s+=c[x];
		return s;
	}
};

signed main() {
	scanf("%lld%lld",&n,&m);
	rep(i,1,m+1) scanf("%lld",o+i),qv[o[i]].pb(i);
	rep(i,1,n+1) scanf("%lld",p+i);
	scanf("%lld",&q);
	rep(i,1,q+1) scanf("%lld%lld%lld",l+i,r+i,a+i);
	rep(i,1,n+1) lo[i]=1,up[i]=q;
	rep(it,0,60) {
		rep(i,1,n+1) tot[i]=0;
		rep(i,1,q+1) qs[i].clear();
		rep(i,1,n+1) qs[(lo[i]+up[i])/2].pb(i);
		ds fenw;
		rep(i,1,q+1) {
			if (l[i]<=r[i]) {
				fenw.modify(l[i],a[i]);
				fenw.modify(r[i]+1,-a[i]);
			} else {
				fenw.modify(l[i],a[i]);
				fenw.modify(1,a[i]);
				fenw.modify(r[i]+1,-a[i]);
			}
			for (auto x:qs[i]) for (auto y:qv[x])
				tot[x]+=fenw.query(y);
		}
		rep(i,1,n+1) {
			int md=(lo[i]+up[i])/2;
			if (tot[i]>=p[i]) up[i]=md,ok[i]=1;
			else lo[i]=md+1;
		}
	}
	rep(i,1,n+1) {
		if (!ok[i]) puts("NIE");
		else printf("%lld\n",up[i]);
	}
}

Compilation message

met.cpp: In function 'int main()':
met.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  scanf("%lld%lld",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~
met.cpp:46:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   46 |  rep(i,1,m+1) scanf("%lld",o+i),qv[o[i]].pb(i);
      |               ~~~~~^~~~~~~~~~~~
met.cpp:47:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |  rep(i,1,n+1) scanf("%lld",p+i);
      |               ~~~~~^~~~~~~~~~~~
met.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  scanf("%lld",&q);
      |  ~~~~~^~~~~~~~~~~
met.cpp:49:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |  rep(i,1,q+1) scanf("%lld%lld%lld",l+i,r+i,a+i);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16844 KB Output is correct
2 Correct 20 ms 16972 KB Output is correct
3 Correct 19 ms 16844 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16968 KB Output is correct
2 Correct 20 ms 16944 KB Output is correct
3 Correct 20 ms 17004 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 19908 KB Output is correct
2 Correct 453 ms 23508 KB Output is correct
3 Correct 304 ms 22212 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 21452 KB Output is correct
2 Correct 344 ms 21444 KB Output is correct
3 Correct 469 ms 23840 KB Output is correct
4 Correct 93 ms 20672 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 342 ms 20360 KB Output is correct
2 Correct 583 ms 24068 KB Output is correct
3 Correct 377 ms 18068 KB Output is correct
4 Correct 312 ms 22940 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 19012 KB Output is correct
2 Correct 470 ms 21392 KB Output is correct
3 Correct 225 ms 19408 KB Output is correct
4 Correct 427 ms 25224 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3082 ms 51752 KB Output is correct
2 Incorrect 2373 ms 28720 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3104 ms 49416 KB Output is correct
2 Incorrect 2317 ms 28708 KB Output isn't correct
3 Halted 0 ms 0 KB -