oj.uz

Submission #43530

# Submission time Handle Problem Language Result Execution time Memory
43530 2018-03-17T10:54:12 Z nonocut Teams (IOI15_teams) C++14
100 / 100
 3916 ms 379576 KB 
#include "teams.h"
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define X first
#define Y second

const int maxn = 5e5 + 5;

struct node {
    int val;
    node *l, *r;
};

int n,m;
vector<int> p[maxn];
node* root[maxn];

pii q[maxn];
int used[maxn];

node* getnode() {
    node* temp = new node;
    temp->val = 0; temp->l = temp->r = nullptr;
    return temp;
}

void build(node *pos, int l, int r) {
    if(l==r) return ;
    int mid = (l+r)/2;
    pos->l = getnode(); pos->r = getnode();
    build(pos->l, l, mid); build(pos->r, mid+1, r);
    pos->val = pos->l->val + pos->r->val;
}

void upgrade(node *last, node *pos, int l, int r, int x) {
    if(l==r) {
        pos->val = last->val + 1;
        return ;
    }
    int mid = (l+r)/2;
    if(x<=mid) {
        pos->l = getnode();
        pos->r = last->r;
        upgrade(last->l, pos->l, l, mid, x);
    }
    else {
        pos->l = last->l;
        pos->r = getnode();
        upgrade(last->r, pos->r, mid+1, r, x);
    }
    pos->val = pos->l->val + pos->r->val;
}

int query(node *pos, int l, int r, int x, int y) {
    if(r<x || y<l) return 0;
    if(x<=l && r<=y) return pos->val;
    int mid = (l+r)/2;
    return query(pos->l,l,mid,x,y) + query(pos->r,mid+1,r,x,y);
}

void init(int N, int A[], int B[]) {
    n = N;
    for(int i=0;i<n;i++) p[A[i]].push_back(B[i]);
    root[0] = getnode();
    build(root[0],1,n);
    for(int i=1;i<=n;i++) {
        root[i] = root[i-1];
        for(auto x : p[i]) {
            node *temp = getnode();
            upgrade(root[i],temp,1,n,x);
            root[i] = temp;
        }
    }
}

int can(int M, int K[]) {
    int sum = 0;
    for(int i=0;i<M;i++) sum += K[i];
    if(sum>n) return 0;
    sort(K, K+M); m = 0;
    for(int i=0;i<M;i++) {
        if(i==0 || K[i]!=K[i-1]) q[++m] = {K[i], 0};
        q[m].Y += K[i];
    }
    q[m+1].X = n+1;
    for(int i=1;i<=m;i++) used[i] = 0;
    for(int i=1;i<=m;i++) {
        int want = q[i].Y;
//        printf("want %d : %d\n",i,want);
        for(int j=i;j<=m;j++) {
            int have = query(root[q[i].X],1,n,q[j].X,q[j+1].X-1) - used[j];
            used[j] += min(want, have);
            want -= min(want, have);
            if(want==0) break;
//            printf("----- have [%d, %d] => [%d, %d] : %d - %d\n",1,q[i].X,q[j].X,q[j+1].X-1,have+used[j],used[j]);
        }
        if(want>0) return 0;
    }
    return 1;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 11 ms 12256 KB Output is correct
3 Correct 11 ms 12256 KB Output is correct
4 Correct 11 ms 12256 KB Output is correct
5 Correct 11 ms 12256 KB Output is correct
6 Correct 11 ms 12436 KB Output is correct
7 Correct 11 ms 12436 KB Output is correct
8 Correct 11 ms 12436 KB Output is correct
9 Correct 11 ms 12488 KB Output is correct
10 Correct 13 ms 12488 KB Output is correct
11 Correct 11 ms 12488 KB Output is correct
12 Correct 11 ms 12488 KB Output is correct
13 Correct 11 ms 12488 KB Output is correct
14 Correct 11 ms 12488 KB Output is correct
15 Correct 14 ms 12488 KB Output is correct
16 Correct 11 ms 12488 KB Output is correct
17 Correct 14 ms 12488 KB Output is correct
18 Correct 13 ms 12488 KB Output is correct
19 Correct 13 ms 12488 KB Output is correct
20 Correct 12 ms 12488 KB Output is correct
21 Correct 11 ms 12488 KB Output is correct
22 Correct 11 ms 12488 KB Output is correct
23 Correct 14 ms 12488 KB Output is correct
24 Correct 14 ms 12488 KB Output is correct
25 Correct 12 ms 12488 KB Output is correct
26 Correct 11 ms 12488 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 220 ms 77292 KB Output is correct
2 Correct 205 ms 77400 KB Output is correct
3 Correct 189 ms 77484 KB Output is correct
4 Correct 194 ms 77744 KB Output is correct
5 Correct 122 ms 77744 KB Output is correct
6 Correct 130 ms 77744 KB Output is correct
7 Correct 129 ms 77744 KB Output is correct
8 Correct 121 ms 77744 KB Output is correct
9 Correct 123 ms 77744 KB Output is correct
10 Correct 119 ms 77744 KB Output is correct
11 Correct 124 ms 77744 KB Output is correct
12 Correct 117 ms 77744 KB Output is correct
13 Correct 149 ms 77744 KB Output is correct
14 Correct 147 ms 77744 KB Output is correct
15 Correct 184 ms 77744 KB Output is correct
16 Correct 176 ms 77744 KB Output is correct
17 Correct 137 ms 77744 KB Output is correct
18 Correct 144 ms 77744 KB Output is correct

Subtask #3
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 77792 KB Output is correct
2 Correct 253 ms 77796 KB Output is correct
3 Correct 332 ms 80712 KB Output is correct
4 Correct 192 ms 80712 KB Output is correct
5 Correct 149 ms 80712 KB Output is correct
6 Correct 150 ms 80712 KB Output is correct
7 Correct 184 ms 80712 KB Output is correct
8 Correct 148 ms 80712 KB Output is correct
9 Correct 137 ms 80712 KB Output is correct
10 Correct 132 ms 80712 KB Output is correct
11 Correct 167 ms 80712 KB Output is correct
12 Correct 1212 ms 80712 KB Output is correct
13 Correct 404 ms 80712 KB Output is correct
14 Correct 387 ms 80712 KB Output is correct
15 Correct 207 ms 80712 KB Output is correct
16 Correct 224 ms 80712 KB Output is correct
17 Correct 153 ms 80712 KB Output is correct
18 Correct 152 ms 80712 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1411 ms 373644 KB Output is correct
2 Correct 1367 ms 373852 KB Output is correct
3 Correct 1701 ms 379576 KB Output is correct
4 Correct 1267 ms 379576 KB Output is correct
5 Correct 722 ms 379576 KB Output is correct
6 Correct 699 ms 379576 KB Output is correct
7 Correct 686 ms 379576 KB Output is correct
8 Correct 745 ms 379576 KB Output is correct
9 Correct 621 ms 379576 KB Output is correct
10 Correct 642 ms 379576 KB Output is correct
11 Correct 2530 ms 379576 KB Output is correct
12 Correct 3916 ms 379576 KB Output is correct
13 Correct 1658 ms 379576 KB Output is correct
14 Correct 1743 ms 379576 KB Output is correct
15 Correct 1123 ms 379576 KB Output is correct
16 Correct 1115 ms 379576 KB Output is correct
17 Correct 701 ms 379576 KB Output is correct
18 Correct 755 ms 379576 KB Output is correct