Submission #556935

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
556935	2022-05-04T12:00:17 Z	shahriarkhan	Meteors (POI11_met)	C++14	100 / 100	1319 ms	31872 KB

#include<bits/stdc++.h>
using namespace std ;

const int MX = 3e5 + 5 ;

struct query
{
    int l = 0 , r = 0 ;
    long long val = 0 ;
};

struct BIT
{
    int n ;
    vector<long long> bit ;
    void init(int _n)
    {
        n = _n ;
        bit = vector<long long>(n+5,0) ;
    }
    int low_bit(int idx)
    {
        return idx&(-idx) ;
    }
    void add(int idx , long long val)
    {
        for(; idx <= n ; idx += low_bit(idx))
        {
            bit[idx] += val ;
        }
    }
    void update(int l , int r , long long val)
    {
        add(r + 1 , -val) , add(l , val) ;
        if(l>r) add(1,val) , add(n+1,-val) ;
    }
    long long query(int idx)
    {
        long long ret = 0 ;
        for(; idx > 0 ; idx -= low_bit(idx))
        {
            ret += bit[idx] ;
        }
        return ret ;
    }
} B ;

int n , m , k , o[MX] , ans[MX] ;

long long p[MX] ;

vector<int> owner[MX] ;

vector<query> q ;

void palbs(int low , int high , vector<int> &vals)
{
    if(low>high) return ;
    if(vals.empty()) return ;
    int mid = (low+high)>>1 ;
    for(int i = low ; i <= mid ; ++i)
    {
        B.update(q[i].l,q[i].r,q[i].val) ;
    }
    vector<int> ok , not_ok ;
    for(int c : vals)
    {
        unsigned long long sum = 0 ;
        for(int land : owner[c])
        {
           sum += B.query(land) ;
        }
        if(sum>=p[c]) ans[c] = mid , ok.push_back(c) ;
        else
        {
            p[c] -= sum ;
            not_ok.push_back(c) ;
        }
    }
    for(int i = low ; i <= mid ; ++i)
    {
        B.update(q[i].l,q[i].r,-q[i].val) ;
    }
    vals.clear() ;
    if(low==high) return ;
    palbs(low,mid,ok) ;
    palbs(mid+1,high,not_ok) ;
}

int main()
{
    vector<int> v ;
    scanf("%d%d",&n,&m) ;
    B.init(m+2) ;
    for(int i = 1 ; i <= m ; ++i)
    {
        scanf("%d",&o[i]) ;
        owner[o[i]].push_back(i) ;
    }
    for(int i = 1 ; i <= n ; ++i)
    {
        scanf("%lld",&p[i]) ;
        ans[i] = -1 ;
        v.push_back(i) ;
    }
    scanf("%d",&k) ;
    for(int i = 1 ; i <= k ; ++i)
    {
        int l , r ;
        long long a ;
        scanf("%d%d%lld",&l,&r,&a) ;
        q.push_back({l,r,a}) ;
    }
    palbs(0,k-1,v) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        if(ans[i]>=0) printf("%d\n",ans[i]+1) ;
        else puts("NIE") ;
    }
    return 0 ;
}

Compilation message

met.cpp: In function 'void palbs(int, int, std::vector<int>&)':
met.cpp:73:15: warning: comparison of integer expressions of different signedness: 'long long unsigned int' and 'long long int' [-Wsign-compare]
   73 |         if(sum>=p[c]) ans[c] = mid , ok.push_back(c) ;
      |            ~~~^~~~~~
met.cpp: In function 'int main()':
met.cpp:93:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |     scanf("%d%d",&n,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~
met.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         scanf("%d",&o[i]) ;
      |         ~~~~~^~~~~~~~~~~~
met.cpp:102:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         scanf("%lld",&p[i]) ;
      |         ~~~~~^~~~~~~~~~~~~~
met.cpp:106:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |     scanf("%d",&k) ;
      |     ~~~~~^~~~~~~~~
met.cpp:111:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  111 |         scanf("%d%d%lld",&l,&r,&a) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	7380 KB	Output is correct
2	Correct	5 ms	7380 KB	Output is correct
3	Correct	5 ms	7380 KB	Output is correct

Subtask #2
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	7380 KB	Output is correct
2	Correct	5 ms	7380 KB	Output is correct
3	Correct	6 ms	7380 KB	Output is correct

Subtask #3
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	36 ms	9500 KB	Output is correct
2	Correct	80 ms	11456 KB	Output is correct
3	Correct	83 ms	9756 KB	Output is correct

Subtask #4
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	81 ms	9664 KB	Output is correct
2	Correct	94 ms	9744 KB	Output is correct
3	Correct	63 ms	10800 KB	Output is correct
4	Correct	29 ms	9320 KB	Output is correct

Subtask #5
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	66 ms	9676 KB	Output is correct
2	Correct	78 ms	11112 KB	Output is correct
3	Correct	26 ms	8540 KB	Output is correct
4	Correct	90 ms	9956 KB	Output is correct

Subtask #6
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	43 ms	9288 KB	Output is correct
2	Correct	89 ms	9744 KB	Output is correct
3	Correct	55 ms	9392 KB	Output is correct
4	Correct	102 ms	10708 KB	Output is correct

Subtask #7
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	460 ms	26688 KB	Output is correct
2	Correct	268 ms	20380 KB	Output is correct
3	Correct	118 ms	11592 KB	Output is correct
4	Correct	1191 ms	28644 KB	Output is correct

Subtask #8
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	490 ms	24460 KB	Output is correct
2	Correct	290 ms	20300 KB	Output is correct
3	Correct	76 ms	11620 KB	Output is correct
4	Correct	1319 ms	31872 KB	Output is correct