제출 #729543

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
729543	2023-04-24 08:53:31	abcvuitunggio	운세 보기 2 (JOI14_fortune_telling2)	C++17	100 / 100	480 ms	30136 KiB

fortune_telling2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF=1e9;
int n,k,a[200001],b[200001],t[200001],st[800001],ft[400001],pos[200001],res;
vector <int> ve,v[200001];
void update(int node, int l, int r, int x, int val){
    if (ve[l]>x||ve[r]<x||l>r)
        return;
    if (l==r){
        st[node]=val;
        return;
    }
    int mid=(l+r)>>1;
    update(node<<1,l,mid,x,val);
    update(node<<1|1,mid+1,r,x,val);
    st[node]=max(st[node<<1],st[node<<1|1]);
}
int get(int node, int l, int r, int u, int v){
    if (ve[l]>v||ve[r]<u||l>r||u>v)
        return 0;
    if (ve[l]>=u&&ve[r]<=v)
        return st[node];
    int mid=(l+r)>>1;
    return max(get(node<<1,l,mid,u,v),get(node<<1|1,mid+1,r,u,v));
}
void update(int i){
    i=lower_bound(ve.begin(),ve.end(),i)-ve.begin()+1;
    for (;i<=ve.size();i+=i&(-i))
        ft[i]++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

컴파일 시 표준 에러 (stderr) 메시지

fortune_telling2.cpp: In function 'void update(long long int)':
fortune_telling2.cpp:29:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (;i<=ve.size();i+=i&(-i))
      |           ~^~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 31 / 31
• Subtask 3: 65 / 65