oj.uz

Submission #1022664

# Submission time Handle Problem Language Result Execution time Memory
1022664 2024-07-13T21:55:53 Z JakobZorz Radio Towers (IOI22_towers) C++17
23 / 100
 4000 ms 2012 KB 
#include"towers.h"
#include<vector>
#include<iostream>
using namespace std;

vector<int>arr;
vector<int>thres;

void init(int N,vector<int>H){
    arr=H;
    
    int n=(int)arr.size();
    int res=0;
    thres.resize(n);
    
    for(int i=0;i<n;i++){
        int mn=2e9;
        
        int mx1=0;
        for(int j=i;j>=0;j--){
            mx1=max(mx1,arr[j]);
            if(arr[j]<arr[i]){
                mn=min(mn,mx1);
                break;
            }
        }
        
        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];
    }
}

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;
}

Compilation message

towers.cpp: In function 'void init(int, std::vector<int>)':
towers.cpp:13:9: warning: unused variable 'res' [-Wunused-variable]
   13 |     int res=0;
      |         ^~~

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 KB Output is correct
9 Correct 2 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 2 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 460 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 1 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 KB Output is correct
9 Correct 2 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 2 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 460 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 1 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 14 ms 1880 KB Output is correct
38 Correct 19 ms 1880 KB Output is correct
39 Correct 10 ms 1976 KB Output is correct
40 Correct 13 ms 1880 KB Output is correct
41 Correct 10 ms 1880 KB Output is correct
42 Correct 10 ms 1880 KB Output is correct
43 Correct 3114 ms 2000 KB Output is correct
44 Correct 3274 ms 1992 KB Output is correct
45 Correct 1973 ms 1880 KB Output is correct
46 Correct 2378 ms 1880 KB Output is correct
47 Correct 11 ms 1880 KB Output is correct
48 Correct 10 ms 1880 KB Output is correct
49 Correct 11 ms 1852 KB Output is correct
50 Correct 3232 ms 1984 KB Output is correct
51 Correct 3068 ms 1980 KB Output is correct
52 Correct 11 ms 1880 KB Output is correct
53 Correct 13 ms 1856 KB Output is correct
54 Correct 10 ms 1880 KB Output is correct
55 Correct 3257 ms 1836 KB Output is correct
56 Correct 1489 ms 1984 KB Output is correct
57 Correct 11 ms 1880 KB Output is correct
58 Correct 11 ms 1880 KB Output is correct
59 Correct 11 ms 2012 KB Output is correct
60 Correct 10 ms 1880 KB Output is correct
61 Correct 19 ms 1848 KB Output is correct
62 Correct 11 ms 1880 KB Output is correct
63 Correct 11 ms 1880 KB Output is correct
64 Correct 3150 ms 1988 KB Output is correct
65 Correct 3137 ms 1880 KB Output is correct
66 Correct 1819 ms 1880 KB Output is correct
67 Correct 3090 ms 1880 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1707 ms 784 KB Output is correct
2 Execution timed out 4002 ms 1856 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 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 348 KB Output is correct
9 Correct 2 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 2 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 2 ms 460 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 1 ms 344 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 2 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 7 ms 1368 KB Output is correct
37 Correct 14 ms 1880 KB Output is correct
38 Correct 19 ms 1880 KB Output is correct
39 Correct 10 ms 1976 KB Output is correct
40 Correct 13 ms 1880 KB Output is correct
41 Correct 10 ms 1880 KB Output is correct
42 Correct 10 ms 1880 KB Output is correct
43 Correct 3114 ms 2000 KB Output is correct
44 Correct 3274 ms 1992 KB Output is correct
45 Correct 1973 ms 1880 KB Output is correct
46 Correct 2378 ms 1880 KB Output is correct
47 Correct 11 ms 1880 KB Output is correct
48 Correct 10 ms 1880 KB Output is correct
49 Correct 11 ms 1852 KB Output is correct
50 Correct 3232 ms 1984 KB Output is correct
51 Correct 3068 ms 1980 KB Output is correct
52 Correct 11 ms 1880 KB Output is correct
53 Correct 13 ms 1856 KB Output is correct
54 Correct 10 ms 1880 KB Output is correct
55 Correct 3257 ms 1836 KB Output is correct
56 Correct 1489 ms 1984 KB Output is correct
57 Correct 11 ms 1880 KB Output is correct
58 Correct 11 ms 1880 KB Output is correct
59 Correct 11 ms 2012 KB Output is correct
60 Correct 10 ms 1880 KB Output is correct
61 Correct 19 ms 1848 KB Output is correct
62 Correct 11 ms 1880 KB Output is correct
63 Correct 11 ms 1880 KB Output is correct
64 Correct 3150 ms 1988 KB Output is correct
65 Correct 3137 ms 1880 KB Output is correct
66 Correct 1819 ms 1880 KB Output is correct
67 Correct 3090 ms 1880 KB Output is correct
68 Execution timed out 4056 ms 1880 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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