oj.uz

답안 #952224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952224 2024-03-23T10:09:19 Z nghiaaa 팀들 (IOI15_teams) C++17
13 / 100
 2048 ms 506100 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;
    int _r ;
    IT * __ = get(tree->l,k,left,preOrder,l,mid,arr->l);
    newTree->l = __;
    if (left){
        __ = get(tree->r,k,left,preOrder,mid+1,r,arr->r);
        newTree->r = __;
        newTree->preOrder = 0;
        _r = newTree->r->use;
    }
    else _r = preOrder?upper_bound(all(arr->r->tap),lastOfUs)-begin(arr->r->tap):newTree->r->use;
    newTree->use = newTree->l->use + _r;
    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);
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
teams.cpp:95:23: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   95 |     else _r = preOrder?upper_bound(all(arr->r->tap),lastOfUs)-begin(arr->r->tap):newTree->r->use;
      |               ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 21.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 41564 KB Output is correct
2 Correct 43 ms 41460 KB Output is correct
3 Correct 51 ms 41712 KB Output is correct
4 Correct 45 ms 42072 KB Output is correct
5 Correct 28 ms 37656 KB Output is correct
6 Correct 27 ms 37468 KB Output is correct
7 Correct 25 ms 37468 KB Output is correct
8 Correct 25 ms 37464 KB Output is correct
9 Correct 106 ms 103028 KB Output is correct
10 Correct 50 ms 49924 KB Output is correct
11 Correct 27 ms 39380 KB Output is correct
12 Correct 25 ms 37064 KB Output is correct
13 Correct 32 ms 37832 KB Output is correct
14 Correct 34 ms 39276 KB Output is correct
15 Correct 42 ms 41044 KB Output is correct
16 Correct 42 ms 41044 KB Output is correct
17 Correct 28 ms 37980 KB Output is correct
18 Correct 29 ms 37980 KB Output is correct

Subtask #3
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 42512 KB Output is correct
2 Correct 55 ms 42904 KB Output is correct
3 Correct 506 ms 178044 KB Output is correct
4 Correct 46 ms 41812 KB Output is correct
5 Correct 236 ms 102736 KB Output is correct
6 Correct 204 ms 94232 KB Output is correct
7 Correct 30 ms 38236 KB Output is correct
8 Correct 156 ms 80212 KB Output is correct
9 Correct 106 ms 103112 KB Output is correct
10 Correct 127 ms 106368 KB Output is correct
11 Correct 164 ms 135368 KB Output is correct
12 Correct 234 ms 156472 KB Output is correct
13 Correct 420 ms 178780 KB Output is correct
14 Correct 557 ms 191368 KB Output is correct
15 Correct 158 ms 113492 KB Output is correct
16 Correct 157 ms 115228 KB Output is correct
17 Incorrect 146 ms 102784 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 269 ms 159824 KB Output is correct
2 Correct 267 ms 160012 KB Output is correct
3 Correct 1928 ms 469748 KB Output is correct
4 Correct 257 ms 159056 KB Output is correct
5 Correct 1164 ms 287420 KB Output is correct
6 Correct 901 ms 268552 KB Output is correct
7 Correct 117 ms 138836 KB Output is correct
8 Correct 816 ms 243008 KB Output is correct
9 Correct 578 ms 506100 KB Output is correct
10 Correct 379 ms 325476 KB Output is correct
11 Correct 478 ms 379500 KB Output is correct
12 Correct 671 ms 428992 KB Output is correct
13 Correct 1731 ms 473028 KB Output is correct
14 Correct 2048 ms 499668 KB Output is correct
15 Incorrect 547 ms 325832 KB Output isn't correct
16 Halted 0 ms 0 KB -