oj.uz

답안 #1022674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022674 2024-07-13T22:21:00 Z JakobZorz 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 2768 KB 
#include"towers.h"
#include<vector>
#include<iostream>
using namespace std;

int n;
vector<int>arr;
vector<int>thres;
vector<int>prv,nxt;

void init_prev(){
    prv.resize(n);
    vector<int>s;
    for(int i=0;i<n;i++){
        while(s.size()&&arr[s.back()]>arr[i])
            s.pop_back();
        if(s.empty())
            prv[i]=-1;
        else
            prv[i]=s.back();
        s.push_back(i);
    }
}

void init_nxt(){
    
}

void init_thres(){
    thres.resize(n);
    for(int i=0;i<n;i++){
        int mn=2e9;
        
        if(prv[i]!=-1){
            int mx1=0;
            for(int j=i;j>prv[i];j--)
                mx1=max(mx1,arr[j]);
            mn=min(mn,mx1);
        }
        
        int mx2=0;
        for(int j=i;j<n;j++){
            mx2=max(mx2,arr[j]);
            if(arr[j]<arr[i]){
                mn=min(mn,mx2);
                break;
            }
        }
        
        thres[i]=mn-arr[i];
    }
}

void init(int N,vector<int>H){
    arr=H;
    n=(int)arr.size();
    init_prev();
    init_nxt();
    init_thres();
}

int max_towers(int L,int R,int D){
    int first=-1,last=-1;
    int res=0;
    for(int i=L;i<=R;i++){
        if(thres[i]>=D){
            res++;
            if(first==-1)
                first=i;
            last=i;
        }
    }
    if(first==-1){
        int sm=L;
        for(int i=L;i<=R;i++)
            if(arr[i]<arr[sm])
                sm=i;
        
        int mx=0;
        for(int i=sm;i<=R;i++){
            if(arr[i]<=mx-D)
                return 2;
            mx=max(mx,arr[i]);
        }
        
        mx=0;
        for(int i=sm;i>=L;i--){
            if(arr[i]<=mx-D)
                return 2;
            mx=max(mx,arr[i]);
        }
            
        return 1;
    }
    
    int mx=0;
    for(int i=first;i>=L;i--){
        if(max(arr[i],arr[first])+D<=mx){
            res++;
            break;
        }
        mx=max(mx,arr[i]);
    }
    
    mx=0;
    for(int i=last;i<=R;i++){
        if(max(arr[i],arr[last])+D<=mx){
            res++;
            break;
        }
        mx=max(mx,arr[i]);
    }
    
    return res;
}

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4033 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 2 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 2 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 8 ms 1624 KB Output is correct
37 Correct 13 ms 2392 KB Output is correct
38 Correct 12 ms 2208 KB Output is correct
39 Correct 11 ms 2396 KB Output is correct
40 Correct 11 ms 2392 KB Output is correct
41 Correct 11 ms 2392 KB Output is correct
42 Correct 11 ms 2392 KB Output is correct
43 Correct 3180 ms 2556 KB Output is correct
44 Correct 9 ms 2392 KB Output is correct
45 Correct 2015 ms 2504 KB Output is correct
46 Correct 392 ms 2392 KB Output is correct
47 Correct 12 ms 2392 KB Output is correct
48 Correct 11 ms 2644 KB Output is correct
49 Correct 11 ms 2392 KB Output is correct
50 Correct 9 ms 2368 KB Output is correct
51 Correct 3062 ms 2768 KB Output is correct
52 Correct 12 ms 2392 KB Output is correct
53 Correct 11 ms 2392 KB Output is correct
54 Correct 11 ms 2216 KB Output is correct
55 Correct 9 ms 2392 KB Output is correct
56 Correct 1481 ms 2508 KB Output is correct
57 Correct 12 ms 2136 KB Output is correct
58 Correct 12 ms 2224 KB Output is correct
59 Correct 12 ms 2392 KB Output is correct
60 Correct 17 ms 2392 KB Output is correct
61 Correct 12 ms 2392 KB Output is correct
62 Correct 11 ms 2392 KB Output is correct
63 Correct 11 ms 2400 KB Output is correct
64 Correct 3127 ms 2516 KB Output is correct
65 Correct 9 ms 2392 KB Output is correct
66 Correct 1819 ms 2524 KB Output is correct
67 Correct 21 ms 2596 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4043 ms 2136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1636 ms 876 KB Output is correct
2 Execution timed out 4051 ms 2392 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 2 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 8 ms 1624 KB Output is correct
37 Correct 13 ms 2392 KB Output is correct
38 Correct 12 ms 2208 KB Output is correct
39 Correct 11 ms 2396 KB Output is correct
40 Correct 11 ms 2392 KB Output is correct
41 Correct 11 ms 2392 KB Output is correct
42 Correct 11 ms 2392 KB Output is correct
43 Correct 3180 ms 2556 KB Output is correct
44 Correct 9 ms 2392 KB Output is correct
45 Correct 2015 ms 2504 KB Output is correct
46 Correct 392 ms 2392 KB Output is correct
47 Correct 12 ms 2392 KB Output is correct
48 Correct 11 ms 2644 KB Output is correct
49 Correct 11 ms 2392 KB Output is correct
50 Correct 9 ms 2368 KB Output is correct
51 Correct 3062 ms 2768 KB Output is correct
52 Correct 12 ms 2392 KB Output is correct
53 Correct 11 ms 2392 KB Output is correct
54 Correct 11 ms 2216 KB Output is correct
55 Correct 9 ms 2392 KB Output is correct
56 Correct 1481 ms 2508 KB Output is correct
57 Correct 12 ms 2136 KB Output is correct
58 Correct 12 ms 2224 KB Output is correct
59 Correct 12 ms 2392 KB Output is correct
60 Correct 17 ms 2392 KB Output is correct
61 Correct 12 ms 2392 KB Output is correct
62 Correct 11 ms 2392 KB Output is correct
63 Correct 11 ms 2400 KB Output is correct
64 Correct 3127 ms 2516 KB Output is correct
65 Correct 9 ms 2392 KB Output is correct
66 Correct 1819 ms 2524 KB Output is correct
67 Correct 21 ms 2596 KB Output is correct
68 Execution timed out 4043 ms 2136 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4033 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -