제출 #1066693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066693		hasan2006	Radio Towers (IOI22_towers)	C++17	11 / 100	4065 ms	1624 KiB

towers

#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
int b[N] , dp[N] , c[N] , d[N] , n ;
vector<int>a;


void init(int n , vector<int>a){
    ::a = a;
    ::n = n;
}


int max_towers(int l ,int r , int k){
    int mx = 1 , i , j , x , y , s , f , m;
    dp[r] = 1;
    for(i = r - 1; i >= l; i--){
        f = 0 , s = 0;
        for(j= i + 1; j <= r; j++){
            if(f - k >= a[j] && f - k >= a[i]){
                s = dp[j];
                break;
            }
            f = max(f , a[j]);

        }
        dp[i] = max(s + 1 , dp[i + 1]);
    }
    return dp[l];
}
/*
int main(){
    TL;

    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
  //  init(7, {10, 20, 60, 40, 50, 30, 70});
  //  cout<<max_towers(1 , 5 , 10)<<"\n";
//}
// Author : حسن

컴파일 시 표준 에러 (stderr) 메시지

towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:33:9: warning: unused variable 'mx' [-Wunused-variable]
   33 |     int mx = 1 , i , j , x , y , s , f , m;
      |         ^~
towers.cpp:33:26: warning: unused variable 'x' [-Wunused-variable]
   33 |     int mx = 1 , i , j , x , y , s , f , m;
      |                          ^
towers.cpp:33:30: warning: unused variable 'y' [-Wunused-variable]
   33 |     int mx = 1 , i , j , x , y , s , f , m;
      |                              ^
towers.cpp:33:42: warning: unused variable 'm' [-Wunused-variable]
   33 |     int mx = 1 , i , j , x , y , s , f , m;
      |                                          ^

• Subtask 1: 0 / 4
• Subtask 2: 11 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23