oj.uz

답안 #952215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952215 2024-03-23T09:53:59 Z nghiaaa 팀들 (IOI15_teams) C++17
77 / 100
 1921 ms 524288 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define all(v) v.begin(),v.end()
#define BIT(i) ((ll)1<<(i))
#define endl "\n"
#define debug(x) for (auto p: x) cout<<p<<' ';cout<<endl
#define forw(i,j,z) for(int i=(int)j;i<=(int)z;i++)
#define forw2(i,j,z,k) for(int i=(int)j;i<=(int)z;i+=k)
#define ford(i,j,z) for (int i=(int)j;i>=(int)z;i--)
#define ford2(i,j,z,k) for (int i=(int)j;i>=(int)z;i-=k)
#define sz(a) (int)a.size()
#define len(a) (int)a.length()
const ll inf=(ll)1<<60;
const int N=5e5;
const int Q=2e5;
int n;
vector<int> DS[N+1];
struct IT_tap{
    IT_tap *l= nullptr;
    IT_tap *r= nullptr;
    vector<int> tap;
    IT_tap():l(nullptr),r(nullptr){}
    IT_tap(IT_tap *L, IT_tap *R):l(L),r(R){}
    IT_tap(IT_tap *L, IT_tap *R,vector<int> &u):l(L),r(R),tap(u){}
};
IT_tap * tree_tap=new IT_tap();
struct IT{
    IT *l= nullptr;
    IT *r= nullptr;
    int use=0,preOrder=0;
    IT():l(nullptr),r(nullptr){}
    IT(IT *L, IT *R):l(L),r(R){}
};
IT *version[Q+10];
IT *build(int l = 1,int r = n, IT_tap *tree = tree_tap)
{
    if (l==r){
        sort(all(DS[l]));
        tree->tap = DS[l];
        return new IT(nullptr,nullptr);
    }
    int mid=(l+r)>>1;
    tree->l=new IT_tap;
    tree->r=new IT_tap;
    IT * tmp= new IT(build(l,mid,tree->l),build(mid+1,r,tree->r));
    tree->tap.assign(sz(tree->l->tap)+sz(tree->r->tap),0);
    merge(all(tree->l->tap),all(tree->r->tap),begin(tree->tap));
    return tmp;
}
void init(int _n,int A[],int B[])
{
    n=_n;
    forw(i,0,n-1){
        DS[B[i]].push_back(A[i]);
    }
    version[0]=build();
}
IT *get(IT *tree,int k,int &left,int lastOfUs = 0,int l = 1,int r = n, IT_tap *arr = tree_tap)
{
    IT *newTree = new IT; *newTree = *tree;
    int mid=(l+r)>>1;
    if (lastOfUs > 0) newTree->use = upper_bound(all(arr->tap),lastOfUs)-begin(arr->tap), newTree->preOrder = lastOfUs;
    if (r < k||left == 0) return newTree;
    int i = upper_bound(all(arr->tap),k)-begin(arr->tap);
    if (l>=k&&i - newTree->use <= left)
    {
        left -= (i - newTree-> use);
        newTree->use = i ;
        newTree->preOrder = k;
        return newTree;
    }
    else if (l==r){
        newTree->use += left;
        left = 0;
        return newTree;
    }
    int preOrder= newTree->preOrder;
    IT * __ = get(tree->l,k,left,preOrder,l,mid,arr->l);
    newTree->l = __;

    __ = get(tree->r,k,left,preOrder,mid+1,r,arr->r);
    newTree->r = __;

    newTree->preOrder = 0;
    newTree->use = newTree->l->use + newTree->r->use;
    return newTree;
}
int can(int m,int query[])
{
    sort(query,query+m);
    forw(i,0,m-1){
        int k=query[i];
        IT * _=get(version[i],query[i],k);
        version[i+1]=_;
        if (k>0) return 0;
    }
    return 1;
}

Compilation message

teams.cpp: In function 'IT* get(IT*, int, int&, int, int, int, IT_tap*)':
teams.cpp:70:73: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   70 |     if (lastOfUs > 0) newTree->use = upper_bound(all(arr->tap),lastOfUs)-begin(arr->tap), newTree->preOrder = lastOfUs;
      |                                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
teams.cpp:72:41: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   72 |     int i = upper_bound(all(arr->tap),k)-begin(arr->tap);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 13576 KB Output is correct
2 Correct 4 ms 13404 KB Output is correct
3 Correct 3 ms 13656 KB Output is correct
4 Correct 3 ms 13660 KB Output is correct
5 Correct 4 ms 13572 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 4 ms 14088 KB Output is correct
8 Correct 4 ms 13916 KB Output is correct
9 Correct 3 ms 13512 KB Output is correct
10 Correct 4 ms 13660 KB Output is correct
11 Correct 3 ms 13404 KB Output is correct
12 Correct 6 ms 15372 KB Output is correct
13 Correct 4 ms 14428 KB Output is correct
14 Correct 4 ms 13916 KB Output is correct
15 Correct 4 ms 13660 KB Output is correct
16 Correct 4 ms 13580 KB Output is correct
17 Correct 5 ms 13916 KB Output is correct
18 Correct 3 ms 13828 KB Output is correct
19 Correct 3 ms 13660 KB Output is correct
20 Correct 3 ms 13660 KB Output is correct
21 Correct 4 ms 13656 KB Output is correct
22 Correct 3 ms 13660 KB Output is correct
23 Correct 3 ms 13660 KB Output is correct
24 Correct 4 ms 13660 KB Output is correct
25 Correct 4 ms 13656 KB Output is correct
26 Correct 4 ms 13660 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 42596 KB Output is correct
2 Correct 51 ms 42780 KB Output is correct
3 Correct 48 ms 42580 KB Output is correct
4 Correct 50 ms 43292 KB Output is correct
5 Correct 27 ms 38752 KB Output is correct
6 Correct 28 ms 38476 KB Output is correct
7 Correct 25 ms 38244 KB Output is correct
8 Correct 26 ms 38232 KB Output is correct
9 Correct 113 ms 103976 KB Output is correct
10 Correct 50 ms 58164 KB Output is correct
11 Correct 36 ms 40916 KB Output is correct
12 Correct 27 ms 38100 KB Output is correct
13 Correct 31 ms 38860 KB Output is correct
14 Correct 42 ms 40392 KB Output is correct
15 Correct 42 ms 42188 KB Output is correct
16 Correct 54 ms 42324 KB Output is correct
17 Correct 27 ms 38916 KB Output is correct
18 Correct 39 ms 39028 KB Output is correct

Subtask #3
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 43860 KB Output is correct
2 Correct 53 ms 44336 KB Output is correct
3 Correct 509 ms 191588 KB Output is correct
4 Correct 46 ms 43408 KB Output is correct
5 Correct 237 ms 140112 KB Output is correct
6 Correct 214 ms 126760 KB Output is correct
7 Correct 31 ms 39760 KB Output is correct
8 Correct 172 ms 104932 KB Output is correct
9 Correct 101 ms 103932 KB Output is correct
10 Correct 161 ms 150732 KB Output is correct
11 Correct 210 ms 183756 KB Output is correct
12 Correct 262 ms 191944 KB Output is correct
13 Correct 452 ms 213196 KB Output is correct
14 Correct 547 ms 207748 KB Output is correct
15 Correct 188 ms 143068 KB Output is correct
16 Correct 198 ms 146128 KB Output is correct
17 Correct 158 ms 127948 KB Output is correct
18 Correct 173 ms 144488 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 281 ms 165800 KB Output is correct
2 Correct 278 ms 166524 KB Output is correct
3 Correct 1921 ms 503000 KB Output is correct
4 Correct 263 ms 162976 KB Output is correct
5 Correct 1230 ms 372000 KB Output is correct
6 Correct 996 ms 342780 KB Output is correct
7 Correct 119 ms 141652 KB Output is correct
8 Correct 874 ms 303420 KB Output is correct
9 Correct 539 ms 508928 KB Output is correct
10 Correct 460 ms 427428 KB Output is correct
11 Correct 553 ms 481732 KB Output is correct
12 Correct 736 ms 512964 KB Output is correct
13 Runtime error 1767 ms 524288 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -