oj.uz

답안 #502039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502039 2022-01-05T06:38:45 Z Nuraly_Serikbay Meteors (POI11_met) C++14
0 / 100
 6000 ms 65536 KB 
#include <bits/stdc++.h>
  
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define YOSIK() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"No"<<endl;
#define yes cout<<"Yes"<<endl;
#define a() a + 1, a + n + 1  
#define int long long
  
using namespace std;

/*
#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")
*/

typedef long long ll;
typedef unsigned long long ull;
typedef string S;
typedef double D;
typedef long double lld;
   
const int N = 4e5;
const int modd = 1e9 + 7;
const ll INF = 1e18 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const D eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;   
 
struct edge {
	ll a, b, len;	

    bool operator<(const edge& other) {
        return len < other.len;
    }
};


bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
    return (a.second < b.second);
}
 
void pre (ll a) {
    cout << fixed << setprecision(a);
    return;
}


ll n, m, q;
ll a[N], sum[N], t[N];
ll L[N], R[N], x[N];
vector <ll> p[N], MID[N];
pair <ll, ll> pr[N];

void push (ll v, ll l, ll r) {
	if (t[v] != 0 && l != r) {
		t[v * 2] += t[v];
		t[v * 2 + 1] += t[v];
		t[v] = 0;
	}
	return;
}

void update (ll v, ll tl, ll tr, ll l, ll r, ll val) {
	if (tr < l || r < tl) return;
	if (l <= tl && tr <= r) {
		t[v] += val;
		push (v, l, r);
		return;	
	}
	push (v, l, r);
	ll mid = tl + tr >> 1;
	update (v * 2, tl, mid, l, r, val);
	update (v * 2 + 1, mid + 1, tr, l, r, val);
	return;	
}

ll get (ll v, ll l, ll r, ll pos) {
	if (l == r) return t[v];
	ll mid = l + r >> 1;
	push (v, l, r);
	if (pos <= mid) return get (v * 2, l, mid, pos);
	else return get (v * 2 + 1, mid + 1, r, pos);
}

ll check (ll pos, ll id) {
	for (int i = 1; i <= pos; ++ i) {
		if (L[i] > R[i]) {
			update (1, 1, m, L[i], m, x[i]);
			update (1, 1, m, 1, R[i], x[i]);
		} else {
				update (1, 1, m, L[i], R[i], x[i]);
		}
	}
	ll ans = 0;
	for (auto i: p[id]) ans += get (1, 1, m, i);
	
	for (int i = 1; i <= m * 4; ++ i) t[i] = 0;
	return ans;
}

void Solution (/*Nuraly.Serikbay*/) {
	cin >> n >> m;
	for (int i = 1; i <= m; ++ i) {
		cin >> a[i];
		p[a[i]].pb (i);
	}
	for (int i = 1; i <= n; ++ i) {
		cin >> sum[i];
		}
	cin >> q;
	for (int i = 1; i <= q; ++ i) {
		cin >> L[i] >> R[i] >> x[i];
	}
	for (int i = 1; i <= n; ++ i) {
		ll l = 0, r = q + 1;
		
		//cout << check (q, i) << ' ';
		while (r - l > 1) {
			ll mid = l + r >> 1;
			if (check (mid, i) >= sum[i]) r = mid;
			else l = mid;
		}
		if (q + 1 == r) cout << "NIE\n";
		else cout << r << '\n';
	}
}

main () {
	YOSIK();
	ll T = 1;
	//cin >> T;
	while (T --) {
		Solution ();
	}
	exit (0);
}/*

*/

Compilation message

met.cpp: In function 'void update(ll, ll, ll, ll, ll, ll)':
met.cpp:92:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |  ll mid = tl + tr >> 1;
      |           ~~~^~~~
met.cpp: In function 'll get(ll, ll, ll, ll)':
met.cpp:100:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  100 |  ll mid = l + r >> 1;
      |           ~~^~~
met.cpp: In function 'void Solution()':
met.cpp:140:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  140 |    ll mid = l + r >> 1;
      |             ~~^~~
met.cpp: At global scope:
met.cpp:149:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  149 | main () {
      | ^~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 167 ms 19148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 180 ms 19148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6015 ms 23656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6054 ms 23736 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6068 ms 23108 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 6016 ms 23416 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 159 ms 65536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 154 ms 65536 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -