oj.uz

답안 #377253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377253 2021-03-13T14:38:09 Z practice101 Stove (JOI18_stove) C++14
100 / 100
 24 ms 2444 KB 
#include<bits/stdc++.h>
/*
Created By Tornado2004
*/
using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define imod(a , n) (a % n + n ) % n

#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
#define inF freopen("marathon.in","r",stdin );
#define outF freopen("marathon.out" , "w" , stdout ) ;
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;

#define ll long long
#define logar(x , y) log(x) / log(y)
#define int ll
#define pii pair<int , int >
const int N = 1e5 + 5  , K = 11 , M = N * 4 ;
const ll MOD = 1e9 + 7   , oo = 1e9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-6 ;

//37
// (a ^ b / c ) % mod = (a ^ b ) % MOD * (c ^ (mod - 2)) % mod
// ريتني اعدم المود
int di[] = {-1 , -1 , -1 , -2 , -2 , -2 , 1 , 1 , 1 , 2 , 2 , 2};
int dj[] = {1 , -2 , 2 , -1 , 2 , 1 , -2 , -1 , 2 , -1 , -2 , 1};

int32_t main()
{   //inF;
   // inF;outF;
    fastio;
    int n , k ;
    cin >> n >> k ;

    k -- ;


    vector<int> v ;
    int past , f ;

    for(int i = 0 ; i < n; i ++){
        int a ;
        cin >> a ;
        if(i == 0)f = a ;

        if(i)v.push_back(a - past - 1);
        past = a ;

    }
    int ans = past + 1 - f ;


    sort(v.rbegin() , v.rend());

    for(int i = 0 ; i < k ; i ++)
        ans -= v[i];

    cout << ans ;

}

/*🎂🎁🎉👑
HAPPY TORNADO`S BIRTHDAY 💜💜
*/

Compilation message

stove.cpp: In function 'int32_t main()':
stove.cpp:55:20: warning: 'past' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |     int ans = past + 1 - f ;
      |               ~~~~~^~~
stove.cpp:55:9: warning: 'f' may be used uninitialized in this function [-Wmaybe-uninitialized]
   55 |     int ans = past + 1 - f ;
      |         ^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 21 ms 2412 KB Output is correct
17 Correct 22 ms 2412 KB Output is correct
18 Correct 21 ms 2412 KB Output is correct
19 Correct 20 ms 2412 KB Output is correct
20 Correct 21 ms 2412 KB Output is correct
21 Correct 21 ms 2412 KB Output is correct
22 Correct 23 ms 2412 KB Output is correct
23 Correct 24 ms 2444 KB Output is correct
24 Correct 21 ms 2316 KB Output is correct