oj.uz

답안 #880009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880009 2023-11-28T14:54:11 Z cpptowin 구경하기 (JOI13_watching) C++17
100 / 100
 526 ms 33616 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 2010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf (int)1e18
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b){if (a > b) {a = b; return true;} return false;}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b){if (a < b) {a = b; return true;} return false;}
using namespace std;
int n,A,B;
int a[maxn];
int dp[N][N];
bool check(int val)
{
    fo(i,1,n) fo(j,0,B) dp[i][j] = inf;
    for(int i = 1,j = 1,k = 1; i <= n ; i++)
    {
        while(j < i and a[i] - a[j] >= val) j++;
        while(k < i and a[i] - a[k] >= 2 * val) k++;
        fo(x,0,B) dp[i][x] = dp[j - 1][x] + 1;
        fo(x,0,B - 1) dp[i][x + 1] = min(dp[i][x + 1],dp[k - 1][x]);
    }
    fo(i,0,B) if(dp[n][i] <= A) return 1;
    return 0;
}
main()
{
    #define name "TASK"
    if(fopen(name".inp","r"))
    {
       freopen(name".inp","r",stdin);
       freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    cin >> n >> A >> B;
    if(n <= A + B) return cout << 1,0;
    fo(i,1,n) cin >> a[i];
    sort(a + 1,a + n + 1);
    int l = 1,r = inf,ans;
    while(l <= r)
    {
        int mid = (l + r) >> 1;
        if(check(mid)) ans = mid,r = mid - 1;
        else l = mid + 1;
    }
    cout << ans;
}

Compilation message

watching.cpp:38:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main()
      | ^~~~
watching.cpp: In function 'int main()':
watching.cpp:43:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |        freopen(name".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
watching.cpp:44:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |        freopen(name".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4552 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4696 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 33112 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 472 KB Output is correct
7 Correct 8 ms 33344 KB Output is correct
8 Correct 212 ms 33372 KB Output is correct
9 Correct 35 ms 33372 KB Output is correct
10 Correct 24 ms 33368 KB Output is correct
11 Correct 526 ms 33452 KB Output is correct
12 Correct 288 ms 33616 KB Output is correct
13 Correct 9 ms 33112 KB Output is correct
14 Correct 8 ms 33116 KB Output is correct
15 Correct 8 ms 33372 KB Output is correct