oj.uz

답안 #855573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
855573 2023-10-01T12:56:21 Z RiverFlow 운세 보기 2 (JOI14_fortune_telling2) C++14
4 / 100
 3000 ms 3676 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int a[N], b[N], t[N];

void main_code() {
    int n, k; cin >> n >> k;
    FOR(i, 1, n) cin >> a[i] >> b[i];
    FOR(i, 1, k) cin >> t[i];

    FOR(i, 1, k) {
        FOR(j, 1, n) if (a[j] <= t[i]) swap(a[j], b[j]);
    }
    long long r = 0;
    FOR(j, 1, n) r += a[j];
    cout << r;
}


/*     Let the river flows naturally     */

Compilation message

fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2552 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 3 ms 2524 KB Output is correct
6 Correct 3 ms 2548 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 3 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2552 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 3 ms 2524 KB Output is correct
6 Correct 3 ms 2548 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 3 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 256 ms 2832 KB Output is correct
15 Correct 1002 ms 3160 KB Output is correct
16 Correct 2244 ms 3480 KB Output is correct
17 Execution timed out 3065 ms 3676 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 3 ms 2552 KB Output is correct
4 Correct 3 ms 2396 KB Output is correct
5 Correct 3 ms 2524 KB Output is correct
6 Correct 3 ms 2548 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 3 ms 2396 KB Output is correct
12 Correct 2 ms 2396 KB Output is correct
13 Correct 3 ms 2396 KB Output is correct
14 Correct 256 ms 2832 KB Output is correct
15 Correct 1002 ms 3160 KB Output is correct
16 Correct 2244 ms 3480 KB Output is correct
17 Execution timed out 3065 ms 3676 KB Time limit exceeded
18 Halted 0 ms 0 KB -