oj.uz

답안 #876293

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876293 2023-11-21T13:56:03 Z cpptowin Stove (JOI18_stove) C++14
100 / 100
 15 ms 4828 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 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#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,k;
int a[maxn];
void sub1()
{
    int res = 1e9;
    fo(i,0,n - 1) cin >> a[i];
    fo(mask,0,(1 << n) - 1) if(__builtin_popcount(mask) == k - 1)
    {
        int ans = 0;
        int pre = a[0];
        fo(i,1,n - 1)
        {
            if(bit(mask,i))
            {
                ans += a[i - 1] - pre + 1;
                pre = a[i];
            }
        }
        ans += a[n - 1] - pre + 1;
        res = min(res,ans);
    }
    cout << res;
}
void full()
{
    vi v;
    fo(i,1,n)  cin >> a[i];
    int ans = a[n] - a[1] + 1;
    fo(i,2,n) v.pb(a[i] - a[i - 1]);
    sort(v.begin(),v.end(),greater<int>());
    fo(i,0,min(k - 2,n - 1)) ans -= v[i] - 1;
    cout << ans;
}
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 >> k;
//    if(n <= 20) sub1();
//    else
        full();
}

Compilation message

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

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 480 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 480 KB Output is correct
16 Correct 14 ms 4824 KB Output is correct
17 Correct 15 ms 4596 KB Output is correct
18 Correct 14 ms 4828 KB Output is correct
19 Correct 14 ms 4828 KB Output is correct
20 Correct 14 ms 4720 KB Output is correct
21 Correct 14 ms 4824 KB Output is correct
22 Correct 14 ms 4808 KB Output is correct
23 Correct 14 ms 4824 KB Output is correct
24 Correct 15 ms 4828 KB Output is correct