oj.uz

Submission #513797

# Submission time Handle Problem Language Result Execution time Memory
513797 2022-01-17T15:59:24 Z wildturtle NLO (COCI18_nlo) C++14
99 / 110
 3000 ms 2564 KB 
#include<bits/stdc++.h>
#define ll long long
#define f first
#define sc second
#define pb push_back
using namespace std;
int a,n,m,k,le,ri,sz,cur;
ll ans;
pair < pair <int,int> , int> A[105];
int tree[500005],tree1[500005];
void update(int node,int le,int ri,int start,int end,int val) {
    if(tree1[node]!=0) {
        if(tree1[node]==2) tree[node]=0;
        else tree[node]=ri-le+1;
        if(le!=ri) {
            tree1[2*node]=tree1[node];
            tree1[2*node+1]=tree1[node];
        }
        tree1[node]=0;
    }
    if(end<le || ri<start) return;
    if(start<=le && ri<=end) {
        if(val==2) tree[node]=0;
        else tree[node]=ri-le+1;
        if(le!=ri) {
            tree1[2*node]=val;
            tree1[2*node+1]=val;
        }
        return;
    }
    update(2*node,le,(le+ri)/2,start,end,val);
    update(2*node+1,(le+ri)/2+1,ri,start,end,val);
    tree[node]=tree[2*node]+tree[2*node+1];
}
int getSum(int node,int le,int ri,int start,int end) {
    if(tree1[node]!=0) {
        if(tree1[node]==2) tree[node]=0;
        else tree[node]=ri-le+1;
        if(le!=ri) {
            tree1[2*node]=tree1[node];
            tree1[2*node+1]=tree1[node];
        }
        tree1[node]=0;
    }
    if(end<le || ri<start) return 0;
    if(start<=le && ri<=end) {
        return tree[node];
    }
    return getSum(2*node,le,(le+ri)/2,start,end)+getSum(2*node+1,(le+ri)/2+1,ri,start,end);
}
int main() {
    std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    scanf("%d%d%d", &n, &m, &k);
    for(int i=1;i<=k;i++) {
        scanf("%d%d%d", &A[i].f.f, &A[i].f.sc, &A[i].sc);
    }
    for(int i=1;i<=n;i++) {
        a=0;
        for(int j=k;j>=1;j--) {
            if(abs(i-A[j].f.f)>A[j].sc) continue;
            a=1;
            sz=(A[j].sc*A[j].sc)-(abs(i-A[j].f.f)*abs(i-A[j].f.f));
            sz=sqrtl(sz);
            le=A[j].f.sc-sz;
            ri=A[j].f.sc+sz;
            sz=(ri-le+1);
            cur=sz-getSum(1,1,m,le,ri);
            ans+=(k-j)*cur;
            update(1,1,m,le,ri,1);
        }
        cur=m-getSum(1,1,m,1,m);
        ans+=k*cur;
        if(i!=n && a!=0) update(1,1,m,1,m,2);
    }
    printf("%lld\n", ans);
}

Compilation message

nlo.cpp: In function 'int main()':
nlo.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |     scanf("%d%d%d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
nlo.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         scanf("%d%d%d", &A[i].f.f, &A[i].f.sc, &A[i].sc);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
99.0 / 110.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 23 ms 332 KB Output is correct
3 Correct 23 ms 360 KB Output is correct
4 Correct 169 ms 548 KB Output is correct
5 Correct 175 ms 1336 KB Output is correct
6 Correct 1254 ms 1332 KB Output is correct
7 Correct 527 ms 2564 KB Output is correct
8 Correct 2657 ms 2472 KB Output is correct
9 Correct 1025 ms 2424 KB Output is correct
10 Execution timed out 3060 ms 2272 KB Time limit exceeded