oj.uz

Submission #275537

# Submission time Handle Problem Language Result Execution time Memory
275537 2020-08-20T06:26:25 Z 문홍윤(#5111) Circus (Balkan15_CIRCUS) C++17
49 / 100
 4000 ms 22116 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;
LL m, arr[100010];

struct SEGMENT_TREE{
    struct NODE{
        LL b;
        NODE *l, *r;
        NODE(){b=0; l=r=0;}
    }*rt;
    SEGMENT_TREE(){rt=new NODE();}
    void update(NODE* nd, LL s, LL e, LL a, LL b, LL 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(LL a, LL b, LL val){update(rt, 0ll, m, a, b, val);}
    LL query(NODE* nd, LL s, LL e, LL num){
        LL 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;
    }
    LL query(LL num){return query(rt, 0ll, m, num);}
}seg, seg2;

bool ch[100010];
void init(int N, int M, int P[]){
    n=N; m=(LL)M;
    for(int i=0; i<n; i++)arr[i+1]=(LL)P[i];
    arr[++n]=m;
    sort(arr+1, arr+n+1);
    for(int t=1; t<n; t++){
        LL maxx=0; int maxnum;
        for(int i=1; i<n; i++){
            if(ch[i])continue;
            LL pos=max(seg.query(arr[i])+arr[i], seg2.query(arr[i])-arr[i]);
            if(maxx<=pos){
                maxx=pos;
                maxnum=i;
            }
        }
        if(arr[maxnum]+maxx-m>=0)seg.update(0ll, arr[maxnum]+maxx-m, m-arr[maxnum]);
        seg2.update(arr[maxnum]+m-maxx, m, m+arr[maxnum]);
        ch[maxnum]=true;
    }
}

int minLength(int D){
    LL tmp1=seg.query((LL)D), tmp2=seg2.query((LL)D);
    return (int)min(m-(LL)D-tmp1, m+(LL)D-tmp2);
}

Compilation message

circus.cpp: In function 'void init(int, int, int*)':
circus.cpp:68:19: warning: 'maxnum' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |         ch[maxnum]=true;
      |         ~~~~~~~~~~^~~~~
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
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4074 ms 3952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 53 ms 632 KB Output is correct
6 Correct 40 ms 664 KB Output is correct
7 Correct 47 ms 3772 KB Output is correct
8 Correct 57 ms 3704 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 53 ms 632 KB Output is correct
6 Correct 40 ms 664 KB Output is correct
7 Correct 47 ms 3772 KB Output is correct
8 Correct 57 ms 3704 KB Output is correct
9 Correct 703 ms 20604 KB Output is correct
10 Correct 580 ms 11512 KB Output is correct
11 Correct 590 ms 10632 KB Output is correct
12 Correct 656 ms 22116 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4074 ms 3952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4074 ms 3952 KB Time limit exceeded
2 Halted 0 ms 0 KB -