oj.uz

Submission #488941

# Submission time Handle Problem Language Result Execution time Memory
488941 2021-11-20T20:10:07 Z MilosMilutinovic Meteors (POI11_met) C++14
74 / 100
 1066 ms 36264 KB 
#include <bits/stdc++.h>
using namespace std;
#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;
	}
};

int main() {
	scanf("%d%d",&n,&m);
	rep(i,1,m+1) scanf("%d",o+i),qv[o[i]].pb(i);
	rep(i,1,n+1) scanf("%d",p+i);
	scanf("%d",&q);
	rep(i,1,q+1) scanf("%d%d%d",l+i,r+i,a+i);
	rep(i,1,n+1) lo[i]=1,up[i]=q;
	rep(it,0,22) {
		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("%d\n",up[i]);
	}
}

Compilation message

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

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16844 KB Output is correct
2 Correct 14 ms 16848 KB Output is correct
3 Correct 17 ms 16912 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 16896 KB Output is correct
2 Correct 16 ms 16900 KB Output is correct
3 Correct 18 ms 17096 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 18344 KB Output is correct
2 Correct 191 ms 20576 KB Output is correct
3 Correct 148 ms 20168 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 19644 KB Output is correct
2 Correct 163 ms 19512 KB Output is correct
3 Correct 195 ms 20820 KB Output is correct
4 Correct 50 ms 19060 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 18996 KB Output is correct
2 Correct 219 ms 22464 KB Output is correct
3 Correct 144 ms 18040 KB Output is correct
4 Correct 131 ms 21740 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 17964 KB Output is correct
2 Correct 180 ms 19548 KB Output is correct
3 Correct 100 ms 18172 KB Output is correct
4 Correct 180 ms 21960 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1066 ms 36264 KB Output is correct
2 Incorrect 852 ms 30668 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1035 ms 34716 KB Output is correct
2 Incorrect 764 ms 29192 KB Output isn't correct
3 Halted 0 ms 0 KB -