oj.uz

답안 #863894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
863894 2023-10-21T10:50:10 Z Rifal Autobahn (COI21_autobahn) C++14
50 / 100
 3 ms 2864 KB 
#include <bits/stdc++.h>
#include <fstream>
//#define endl '\n'
#define mod 1000000007
#define INF 900000000

using namespace std;
//ofstream fout("intel.out");
//ifstream fin("intel.in");
const int Max = 1e4;
int cnt[Max], cnt2[Max];
struct Tri {
    int l, t, r;
};
int main()
{
    ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
    int n, k, x; cin >> n >> k >> x; Tri arr[n];
    for(int i = 0; i < n;i++) {
         cin >> arr[i].l >> arr[i].t >> arr[i].r;
         cnt[arr[i].l]++;
         cnt[arr[i].r+1]--;
    }
    for(int i = 1; i <= 1000; i++) {
        cnt[i] += cnt[i-1];
    }
    for(int i = 0; i < n; i++) {
        if(arr[i].r-arr[i].l+1 <= arr[i].t) continue;
        cnt2[arr[i].l+arr[i].t]++;
        cnt2[arr[i].r+1]--;
    }
    for(int i = 1; i <= 1000; i++) {
        cnt2[i] += cnt2[i-1];
    }
    long long ans = 0;
    for(int i = 1; i <= 1000; i++) {
        long long sum = 0;
        for(int j = i; j <= min(i+x-1,1000); j++) {
          //  cout << j << ' ';
            if(cnt[j] >= k)  { 
                
                sum += cnt2[j];
              //  cout << 'f' << j << ' ' << cnt[j] << ' ' << cnt2[j] << ' ' << sum << 'f' << endl;

        }
    }
   ///  cout << 'k' << endl;
        ans = max(ans,sum);
    }
    cout << ans;
 return 0;
}

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 360 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 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 360 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 496 KB Output is correct

Subtask #3
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 360 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 496 KB Output is correct
21 Runtime error 3 ms 2864 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -