oj.uz

답안 #877649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877649 2023-11-23T12:00:40 Z mnbvcxz123 Stove (JOI18_stove) C++17
100 / 100
 38 ms 2420 KB 
    #include<bits/stdc++.h>
    using namespace std;
    #pragma GCC optimize("O3")
     
    #define tof_io  ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
    #define double  long double
    #define int     long long
    #define pb      push_back
     
    #define all(x)  x.begin(),x.end()
    #define endl    '\n'
     
    const int mod = 998244353; //998244353 1e9+7 1e9+9
    const int inf = 1e18;
    const int N = 1e6 + 23;	
    const int lg = 23;
    int fac[N];
    int inv[N];
    int  dnt_pow	(int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
    void dnt_bld	(){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
    int  dnt_ncr	(int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
    int32_t main()
    {
    	int n, k;
    	cin >> n >> k;
    	k--;
    	int sm = 1;
    	priority_queue<int> pq;
    	int y = 0;
    	for(int i = 0; i < n; i++)
    	{
    		int x;
    		cin >> x;
    		if(i!=0)
    		{
    			sm = sm + x - y;
    			pq.push(x-y-1);
    		}
    		y = x;
    	}
        for ( int i = 0; i < min(k,n) ; i++)
            {
     
                sm = sm - pq.top();
                pq.pop();
            }
     
        cout << sm ;
    	
    }

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 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 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 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 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 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 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 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 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 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 29 ms 2248 KB Output is correct
17 Correct 29 ms 2260 KB Output is correct
18 Correct 29 ms 2260 KB Output is correct
19 Correct 30 ms 2376 KB Output is correct
20 Correct 35 ms 2260 KB Output is correct
21 Correct 37 ms 2420 KB Output is correct
22 Correct 37 ms 2260 KB Output is correct
23 Correct 38 ms 2260 KB Output is correct
24 Correct 37 ms 2260 KB Output is correct