oj.uz

답안 #758276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
758276 2023-06-14T11:08:01 Z groshi Fire (JOI20_ho_t5) C++17
7 / 100
 874 ms 135236 KB 
#include<iostream>
#include<vector>
#define int long long
using namespace std;
int t[300000];
int lewo[300000];
int prawo[300000];
pair<int,int> drzewo[4000000][2];
int pot=1;
int wynik[300000];
vector<pair<int,pair<int,int> > > zapp[300000];
vector<pair<int,int> > zmiana[300000];
void add(int x,int l,int r,int a,int b,int co,int gdzie)
{
    if(b<l || a>r)
        return;
    //cout<<"jestem w "<<x<<"\n";
    if(a<=l && r<=b)
    {
        drzewo[x][gdzie].second+=co;
        return;
    }
    int mid=(l+r)/2;
    add(x*2,l,mid,a,b,co,gdzie);
    add(x*2+1,mid+1,r,a,b,co,gdzie);
    drzewo[x][gdzie].first=drzewo[x*2][gdzie].first+drzewo[x*2][gdzie].second*(mid-l+1)+drzewo[x*2+1][gdzie].first+drzewo[x*2+1][gdzie].second*(r-mid);
}
int zap(int x,int l,int r,int a,int b,int gdzie)
{
    if(a>r || b<l)
        return 0;
    if(a<=l && r<=b)
        return drzewo[x][gdzie].first+drzewo[x][gdzie].second*(r-l+1);
    int mid=(l+r)/2;
    return zap(x*2,l,mid,a,b,gdzie)+zap(x*2+1,mid+1,r,a,b,gdzie)+drzewo[x][gdzie].second*(min(b,r)-max(a,l)+1);
}
void dodaj(int x,int l,int r)
{
    //cout<<x<<": "<<l<<" "<<r<<"\n";
    zmiana[0].push_back({x,t[x]});
    zmiana[l].push_back({x,-t[x]});
    zmiana[r].push_back({r+x,-t[x]});
    zmiana[l+r].push_back({x+r,t[x]});
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    while(pot<=800000)
        pot*=2;
    pot--;
    for(int i=1;i<=n;i++)
        cin>>t[i];
    vector<int> Q;
    t[0]=1e18;
    t[n+1]=1e18;
    Q.push_back(0);
    for(int i=1;i<=n;i++)
    {
        while(Q.size() && t[Q.back()]<=t[i])
            Q.pop_back();
        lewo[i]=Q.back();
        Q.push_back(i);
    }
    Q.clear();
    Q.push_back(n+1);
    for(int i=n;i>=1;i--)
    {
        while(Q.size() && t[Q.back()]<t[i])
            Q.pop_back();
        prawo[i]=Q.back();
        Q.push_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        if(lewo[i]==0)
            lewo[i]=n+1;
        else lewo[i]=i-lewo[i];
        prawo[i]-=i;
        dodaj(i,lewo[i],prawo[i]);
    }
    for(int i=1;i<=m;i++)
    {
        int x,y,z;
        cin>>x>>y>>z;
        zapp[x].push_back({i,{y,z}});
    }
    int stala=400000;
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<zmiana[i].size();j++)
        {
            int gdzie=zmiana[i][j].first;
            int ile=zmiana[i][j].second;
            add(1,pot+1,pot*2+1,gdzie+pot,pot*2+1,ile,0);
            add(1,pot+1,pot*2+1,stala+pot+1+gdzie,pot*2+1,-ile,1);
        }
        for(int j=0;j<zapp[i].size();j++)
        {
            int x=zapp[i][j].first;
            int l=zapp[i][j].second.first;
            int r=zapp[i][j].second.second;
            wynik[x]=zap(1,pot+1,pot*2+1,l+pot,r+pot,0)+zap(1,pot+1,pot*2+1,stala+l+pot,stala+r+pot,1);
        }
        stala--;
    }
    for(int i=1;i<=m;i++)
        cout<<wynik[i]<<"\n";
    return 0;
}

Compilation message

ho_t5.cpp: In function 'int32_t main()':
ho_t5.cpp:94:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(int j=0;j<zmiana[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~
ho_t5.cpp:101:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for(int j=0;j<zapp[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14552 KB Output is correct
2 Correct 9 ms 14676 KB Output is correct
3 Correct 8 ms 14684 KB Output is correct
4 Correct 9 ms 14676 KB Output is correct
5 Correct 9 ms 14620 KB Output is correct
6 Correct 9 ms 14676 KB Output is correct
7 Correct 11 ms 14668 KB Output is correct
8 Correct 9 ms 14676 KB Output is correct
9 Correct 9 ms 14672 KB Output is correct
10 Correct 9 ms 14676 KB Output is correct
11 Correct 9 ms 14688 KB Output is correct
12 Correct 9 ms 14636 KB Output is correct
13 Correct 9 ms 14676 KB Output is correct
14 Correct 10 ms 14676 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 8 ms 14676 KB Output is correct
17 Correct 8 ms 14668 KB Output is correct
18 Correct 8 ms 14684 KB Output is correct
19 Correct 8 ms 14684 KB Output is correct
20 Correct 8 ms 14592 KB Output is correct
21 Correct 8 ms 14676 KB Output is correct
22 Correct 9 ms 14592 KB Output is correct
23 Correct 9 ms 14672 KB Output is correct
24 Correct 9 ms 14676 KB Output is correct
25 Correct 9 ms 14676 KB Output is correct
26 Correct 9 ms 14676 KB Output is correct
27 Correct 10 ms 14576 KB Output is correct
28 Correct 11 ms 14672 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 9 ms 14668 KB Output is correct
31 Correct 9 ms 14676 KB Output is correct
32 Correct 10 ms 14756 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14552 KB Output is correct
2 Correct 874 ms 74592 KB Output is correct
3 Runtime error 590 ms 135236 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14552 KB Output is correct
2 Runtime error 166 ms 82072 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 715 ms 69564 KB Output is correct
2 Correct 704 ms 69740 KB Output is correct
3 Correct 694 ms 71000 KB Output is correct
4 Correct 730 ms 69524 KB Output is correct
5 Correct 722 ms 69612 KB Output is correct
6 Correct 782 ms 70228 KB Output is correct
7 Correct 753 ms 71064 KB Output is correct
8 Correct 715 ms 70416 KB Output is correct
9 Correct 726 ms 70000 KB Output is correct
10 Correct 717 ms 70616 KB Output is correct
11 Correct 732 ms 70356 KB Output is correct
12 Correct 702 ms 70448 KB Output is correct
13 Correct 756 ms 70284 KB Output is correct
14 Correct 711 ms 70104 KB Output is correct

Subtask #5
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 14552 KB Output is correct
2 Correct 9 ms 14676 KB Output is correct
3 Correct 8 ms 14684 KB Output is correct
4 Correct 9 ms 14676 KB Output is correct
5 Correct 9 ms 14620 KB Output is correct
6 Correct 9 ms 14676 KB Output is correct
7 Correct 11 ms 14668 KB Output is correct
8 Correct 9 ms 14676 KB Output is correct
9 Correct 9 ms 14672 KB Output is correct
10 Correct 9 ms 14676 KB Output is correct
11 Correct 9 ms 14688 KB Output is correct
12 Correct 9 ms 14636 KB Output is correct
13 Correct 9 ms 14676 KB Output is correct
14 Correct 10 ms 14676 KB Output is correct
15 Correct 9 ms 14676 KB Output is correct
16 Correct 8 ms 14676 KB Output is correct
17 Correct 8 ms 14668 KB Output is correct
18 Correct 8 ms 14684 KB Output is correct
19 Correct 8 ms 14684 KB Output is correct
20 Correct 8 ms 14592 KB Output is correct
21 Correct 8 ms 14676 KB Output is correct
22 Correct 9 ms 14592 KB Output is correct
23 Correct 9 ms 14672 KB Output is correct
24 Correct 9 ms 14676 KB Output is correct
25 Correct 9 ms 14676 KB Output is correct
26 Correct 9 ms 14676 KB Output is correct
27 Correct 10 ms 14576 KB Output is correct
28 Correct 11 ms 14672 KB Output is correct
29 Correct 9 ms 14676 KB Output is correct
30 Correct 9 ms 14668 KB Output is correct
31 Correct 9 ms 14676 KB Output is correct
32 Correct 10 ms 14756 KB Output is correct
33 Correct 874 ms 74592 KB Output is correct
34 Runtime error 590 ms 135236 KB Execution killed with signal 11
35 Halted 0 ms 0 KB -