oj.uz

답안 #492626

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492626 2021-12-08T07:50:09 Z keta_tsimakuridze 사탕 분배 (IOI21_candies) C++17
0 / 100
 4256 ms 50060 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define f first
#define s second
#include "candies.h"
using namespace std;

const int N = 2e5 + 5;
long long lazy[4 * N];
struct node {
	long long mx, mn, id1, id2;
} tree[4 * N], Z;
node merge(node a, node b) {
	node c = {0,0,0,0};
	if(a.mx > b.mx) c.mx = a.mx, c.id1 = a.id1;
	else c.mx = b.mx, c.id1 = b.id1;
	if(a.mn < b.mx) c.mn = a.mn, c.id2 = a.id2;
	else c.mn = b.mn, c.id2 = b.id2;
	return c;
}
void build(int u,int l,int r) {
	if(l == r) {
		tree[u].id1 = tree[u].id2 = l;
		return;
	}
	int mid = (l + r)/2;
	build(2 * u, l, mid); build(2 * u + 1,mid + 1,r);
	tree[u] = merge(tree[2 * u], tree[2 * u + 1]);
}
void push(int u,int l,int r) {
	tree[u].mx += lazy[u];
	tree[u].mn += lazy[u];
	if(l != r) {
		lazy[2 * u] += lazy[u]; lazy[2 * u + 1] += lazy[u];
	}
	lazy[u] = 0;
}
void upd(int u,int st, int en,int l,int r,int val) {
	push(u, l, r);
	if(l > en || r < st) return;
	if(st <= l && r <= en) {
		lazy[u] = val;
		push(u, l, r);
		return;
	}
	int mid = (l + r)/2;
	upd(2 * u,st,en,l,mid,val); upd(2 * u + 1,st,en,mid + 1,r,val);
	tree[u] = merge(tree[2 * u], tree[2 * u + 1]);
}
node get(int u, int st, int en,int l,int r) {
	push(u,l,r);
	if(l > en || r < st) return Z;
	if(st <= l && r <= en) return tree[u];
	int mid = (l + r)/2;
	return merge(get(2 * u,st,en,l,mid), get(2 * u + 1,st,en,mid + 1,r)); 
}
vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size(), q = r.size();
    vector<int> s(n);Z.mn = 1e15;
    vector<vector<pii> > st(n + 1), en(n + 1); 
    for(int i = 0; i < r.size(); i++) {
    	st[l[i]].push_back({i + 1, v[i]});
    	en[r[i] + 1].push_back({i + 1, -v[i]});
	}
	build(1,1,q);
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < en[i].size(); j++) {
			upd(1, 1, en[i][j].f, 1, q, en[i][j].s);
		}
		for(int j = 0; j < st[i].size(); j++) {
			upd(1, 1, st[i][j].f, 1, q, st[i][j].s);
		}
		int last = 0;
		 {
		 
		int l = 1, r = q;
		
		while(l <= r) {
			int mid = (l + r)/2;
			node g = get(1, mid, q, 1, q);
			if(g.mx - g.mn >= c[i]) {
				l = mid + 1;
				last = mid;
			} else r = mid - 1;
		}
		}
		
		int sum = 0;				
		for(int j = last; j < q; j++) {
				if(l[j] <= i && i <= r[j]) {
					sum += v[j];
				}
		}
		if(last == 0) s[i] = sum;
		else if(v[last - 1] > 0) s[i] = c[i] + sum;
		else s[i] = sum;
	}
	
    return s;
}
/*
int main() {
    int n;
    
    assert(1 == scanf("%d", &n));
    std::vector<int> c(n);
    for(int i = 0; i < n; ++i) {
        assert(scanf("%d", &c[i]) == 1);
    }

    int q;
    assert(1 == scanf("%d", &q));
    std::vector<int> l(q), r(q), v(q);
    for(int i = 0; i < q; ++i) {
        assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);
    }

    std::vector<int> ans = distribute_candies(c, l, r, v);

    for(int i = 0; i < n; ++i) {
        if (i > 0) {
            printf(" ");
        }
        printf("%d", ans[i]);
    }
    printf("\n");
    fclose(stdout);
    return 0;
}
*/

Compilation message

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:63:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for(int i = 0; i < r.size(); i++) {
      |                    ~~^~~~~~~~~~
candies.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for(int j = 0; j < en[i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~~
candies.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |   for(int j = 0; j < st[i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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