oj.uz

답안 #122745

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122745 2019-06-29T08:18:27 Z arnold518 Stove (JOI18_stove) C++14
100 / 100
 28 ms 2296 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

int N, K, T[MAXN+10], ans;

int main()
{
    int i, j;

    scanf("%d%d", &N, &K); K--;
    for(i=1; i<=N; i++) scanf("%d", &T[i]);
    ans=T[N]+1-T[1];

    vector<int> V;
    for(i=2; i<=N; i++) if(T[i]>1+T[i-1]) V.push_back(T[i]-T[i-1]-1);

    sort(V.begin(), V.end(), greater<int>());

    for(i=0; i<V.size() && i<K; i++) ans-=V[i];
    printf("%d", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0; i<V.size() && i<K; i++) ans-=V[i];
              ~^~~~~~~~~
stove.cpp:14:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
stove.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K); K--;
     ~~~~~^~~~~~~~~~~~~~~~
stove.cpp:17:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1; i<=N; i++) scanf("%d", &T[i]);
                         ~~~~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 348 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 28 ms 2292 KB Output is correct
17 Correct 27 ms 2292 KB Output is correct
18 Correct 27 ms 2296 KB Output is correct
19 Correct 27 ms 2292 KB Output is correct
20 Correct 27 ms 2292 KB Output is correct
21 Correct 27 ms 2292 KB Output is correct
22 Correct 27 ms 2292 KB Output is correct
23 Correct 27 ms 2292 KB Output is correct
24 Correct 27 ms 2292 KB Output is correct