Submission #945790

#	Time	Username	Problem	Language	Result	Execution time	Memory
945790		WongYiKai	Jousting tournament (IOI12_tournament)	C++14	0 / 100	149 ms	22832 KiB

tournament

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node {
    int s, e;
    ll mn, mx, sum;
    bool lset;
    ll add_val, set_val;
    node *l, *r;
    node (int _s, int _e, int A[] = NULL): s(_s), e(_e), mn(0), mx(0), sum(0), lset(0), add_val(0), set_val(0), l(NULL), r(NULL) {
        if (A == NULL) return;
        if (s == e) mn = mx = sum = A[s];
        else {
            l = new node(s, (s+e)>>1, A), r = new node((s+e+2)>>1, e, A);
            combine();
        }
    }
    void create_children() {
        if (s == e) return;
        if (l != NULL) return;
        int m = (s+e)>>1;
        l = new node(s, m);
        r = new node(m+1, e);
    }
    void self_set(ll v) {
        lset = 1;
        mn = mx = set_val = v;
        sum = v * (e-s+1);
        add_val = 0;
    }
    void self_add(ll v) {
        if (lset) { self_set(v + set_val); return; }
        mn += v, mx += v, add_val += v;
        sum += v*(e-s+1);
    }
    void lazy_propagate() {
        if (s == e) return;
        if (lset) {
            l->self_set(set_val), r->self_set(set_val);
            lset = set_val = 0;
        }   
        if (add_val != 0) {
            l->self_add(add_val), r->self_add(add_val);
            add_val = 0;
        }
    }
    void combine() {
        if (l == NULL) return;
        sum = l->sum + r->sum;
        mn = min(l->mn, r->mn);
        mx = max(l->mx, r->mx);
    }
    void add(int x, int y, ll v) {
        if (s == x && e == y) { self_add(v); return; }
        int m = (s+e)>>1;
        create_children(); lazy_propagate();
        if (x <= m) l->add(x, min(y, m), v);
        if (y > m) r->add(max(x, m+1), y, v);
        combine();
    }
    void set(int x, int y, ll v) {
        if (s == x && e == y) { self_set(v); return; }
        int m = (s+e)>>1;
        create_children(); lazy_propagate();
        if (x <= m) l->set(x, min(y, m), v);
        if (y > m) r->set(max(x, m+1), y, v);
        combine();
    }
    ll range_sum(int x, int y) {
        if (s == x && e == y) return sum;
        if (l == NULL || lset) return (sum / (e-s+1)) * (y-x+1);
        int m = (s+e)>>1;
        lazy_propagate();
        if (y <= m) return l->range_sum(x, y);
        if (x > m) return r->range_sum(x, y);
        return l->range_sum(x, m) + r->range_sum(m+1, y);
    }
    ll range_min(int x, int y) {
        if (s == x && e == y) return mn;
        if (l == NULL || lset) return mn;
        int m = (s+e)>>1;
        lazy_propagate();
        if (y <= m) return l->range_min(x, y);
        if (x > m) return r->range_min(x, y);
        return min(l->range_min(x, m), r->range_min(m+1, y));
    }
    ll range_max(int x, int y) {
        if (s == x && e == y) return mx;
        if (l == NULL || lset) return mx;
        int m = (s+e)>>1;
        lazy_propagate();
        if (y <= m) return l->range_max(x, y);
        if (x > m) return r->range_max(x, y);
        return max(l->range_max(x, m), r->range_max(m+1, y));
    }
    ~node() {
        if (l != NULL) delete l;
        if (r != NULL) delete r;
    }
} *root,*root1,*root2;


int GetBestPosition(int n, int c, int r, int *k, int *s, int *e) {
	root = new node(0,n+5);
	root1 = new node(0,n+5);
	root2 = new node(0,n+5);
	//root -> count
	//root1 -> rank
	//root2 -> alive?
	for (int i=0;i<n-1;i++){
		root1->set(i,i,k[i]);
	}
	root2->set(0,n+1,1);
	for (int i=0;i<c;i++){
		int l=0,r2=n;
		//cout << s[i] << "\n";
		if (s[i]!=0){
			while (l<r2){
				int m = l+(r2-l)/2;
				if (root2->range_sum(0,m)<(s[i])) l=m+1;
				else r2=m;
				//cout << l << " " << r2 << "\n";
			}
			l++;
		}
		/*
		for (int j=0;j<n;j++){
			cout << root2->range_max(j,j) << " ";
		}
		cout << "\n";
		*/
		int start = l;
		l=0,r2=n;
		while (l<r2){
			int m = l+(r2-l)/2;
			if (root2->range_sum(0,m)<(e[i]+1)) l=m+1;
			else r2=m;
		}
		int end=l;
		//cout << "fight: " << start << "," << end << "\n";
		if (root1->range_max(start,end-1)<r){
			//cout << "add: " << start << "," << end << "\n";
			root->add(start,end,1);
		}
		root2->set(start,end-1,0);
		root2->set(end,end,1);
	}
	/*
	for (int i=0;i<n;i++){
		cout << root->range_max(i,i) << " ";
	}
	cout << "\n";
	*/
	return root->range_max(0,n-1);
}

Compilation message (stderr)

tournament.cpp: In member function 'void node::lazy_propagate()':
tournament.cpp:40:28: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   40 |             lset = set_val = 0;
      |                    ~~~~~~~~^~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 32
• Subtask 3: 0 / 51