oj.uz

Submission #275177

# Submission time Handle Problem Language Result Execution time Memory
275177 2020-08-20T04:46:05 Z 문홍윤(#5111) Circus (Balkan15_CIRCUS) C++17
11 / 100
 172 ms 78020 KB 
#include "circus.h"
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2e18;
const int inf=1e9;

int n, m, arr[100010];

struct SEGMENT_TREE{
    struct NODE{
        int b;
        NODE *l, *r;
        NODE(){b=0; l=r=0;}
    }*rt;
    SEGMENT_TREE(){rt=new NODE();}
    void update(NODE* nd, int s, int e, int a, int b, int val){
        if(e<a||s>b)return;
        if(a<=s&&e<=b){
            nd->b=max(nd->b, val);
            return;
        }
        if(!nd->l)nd->l=new NODE();
        if(!nd->r)nd->r=new NODE();
        update(nd->l, s, (s+e)/2, a, b , val);
        update(nd->r, (s+e)/2+1, e, a, b, val);
    }
    void update(int a, int b, int val){update(rt, 0, m, a, b, val);}
    int query(NODE* nd, int s, int e, int num){
        int ret=nd->b;
        if(num<=(s+e)/2&&nd->l)ret=max(ret, query(nd->l, s, (s+e)/2, num));
        if(num>(s+e)/2&&nd->r)ret=max(ret, query(nd->r, (s+e)/2+1, e, num));
        return ret;
    }
    int query(int num){return query(rt, 0, m, num);}
}seg;

void init(int N, int M, int P[]){
    n=N, m=M;
    for(int i=0; i<n; i++)arr[i+1]=P[i];
    arr[++n]=m;
    sort(arr+1, arr+n+1);
    for(int i=n-1; i>=1; i--){
        int pos=seg.query(arr[i]);
        if(2*arr[i]+pos-m>=0)seg.update(0, 2*arr[i]+pos-m, m-arr[i]);
    }
}

int minLength(int D){
    int tmp=seg.query(D);
    return m-D-tmp;
}

Compilation message

grader.cpp: In function 'int main()':
grader.cpp:14:12: warning: unused variable 'max_code' [-Wunused-variable]
   14 |  long long max_code;
      |            ^~~~~~~~
grader.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
grader.cpp:18:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   18 |   scanf("%d", &P[i]);
      |   ~~~~~^~~~~~~~~~~~~
grader.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   21 |  scanf("%d", &Q);
      |  ~~~~~^~~~~~~~~~
grader.cpp:23:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |   scanf("%d", &d);
      |   ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 27768 KB Output is correct
2 Correct 172 ms 78020 KB Output is correct
3 Correct 136 ms 54776 KB Output is correct
4 Correct 99 ms 30584 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 27768 KB Output is correct
2 Correct 172 ms 78020 KB Output is correct
3 Correct 136 ms 54776 KB Output is correct
4 Correct 99 ms 30584 KB Output is correct
5 Incorrect 1 ms 416 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 27768 KB Output is correct
2 Correct 172 ms 78020 KB Output is correct
3 Correct 136 ms 54776 KB Output is correct
4 Correct 99 ms 30584 KB Output is correct
5 Incorrect 1 ms 416 KB Output isn't correct
6 Halted 0 ms 0 KB -