oj.uz

답안 #488952

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488952 2021-11-20T20:29:05 Z MilosMilutinovic Meteors (POI11_met) C++14
74 / 100
 1973 ms 65540 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=300001;
int n,m,q,o[N],p[N],l[N],r[N],a[N],up[N],lo[N],ans[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<=m;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,ans[i]=q+1;
	rep(it,0,50) {
		rep(i,1,n+1) tot[i]=0;
		rep(i,1,q+1) qs[i].clear();
		rep(i,1,n+1) if (lo[i]<=up[i])
			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]) if (tot[x]<p[x]) 
				tot[x]+=fenw.query(y);
		}
		rep(i,1,n+1) {
			if (lo[i]>up[i]) continue;
			int md=(lo[i]+up[i])/2;
			if (tot[i]>=p[i]) ans[i]=md,up[i]=md-1;
			else lo[i]=md+1;
		}
	}
	rep(i,1,n+1) {
		if (ans[i]>q) puts("NIE");
		else printf("%lld\n",ans[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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 16884 KB Output is correct
2 Correct 13 ms 16920 KB Output is correct
3 Correct 14 ms 16784 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 16912 KB Output is correct
2 Correct 13 ms 16844 KB Output is correct
3 Correct 14 ms 17012 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 19952 KB Output is correct
2 Correct 229 ms 23480 KB Output is correct
3 Correct 158 ms 22208 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 21392 KB Output is correct
2 Correct 191 ms 21516 KB Output is correct
3 Correct 226 ms 23812 KB Output is correct
4 Correct 48 ms 20660 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 20388 KB Output is correct
2 Correct 190 ms 24108 KB Output is correct
3 Correct 108 ms 18048 KB Output is correct
4 Correct 164 ms 22928 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 18972 KB Output is correct
2 Correct 206 ms 21368 KB Output is correct
3 Correct 139 ms 19476 KB Output is correct
4 Correct 233 ms 25184 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1970 ms 51680 KB Output is correct
2 Correct 1688 ms 28656 KB Output is correct
3 Correct 491 ms 22976 KB Output is correct
4 Runtime error 987 ms 65540 KB Execution killed with signal 9

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1973 ms 49364 KB Output is correct
2 Correct 1835 ms 28648 KB Output is correct
3 Correct 387 ms 21500 KB Output is correct
4 Runtime error 967 ms 65540 KB Execution killed with signal 9