oj.uz

Submission #1047085

# Submission time Handle Problem Language Result Execution time Memory
1047085 2024-08-07T08:47:33 Z Whisper Lost Array (NOI19_lostarray) C++17
100 / 100
 28 ms 6352 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int N, M;
#define MAX             100005
vector<tuple<int, int, int>> Q;

int A[MAX];

#define cs              1'000'000'000
int a[MAX], b[MAX], c[MAX];
void process(void){
    cin >> N >> M;
    FOR(i, 1, N) A[i] = cs;
    for (int i = 1; i <= M; ++i){
        int a, b, c; cin >> a >> b >> c;
        Q.emplace_back(c, a, b);
    }
    sort(Q.begin(), Q.end());
    for (tuple<int, int, int>&x : Q){
        int a, b, c; tie(c, a, b) = x;
        A[a] = A[b] = c;
    }
    for (int i = 1; i <= N; ++i) cout << A[i] << " ";
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 1 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 1 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 5 ms 2008 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 4 ms 1628 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 1 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 5 ms 2008 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 4 ms 1628 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1368 KB Output is correct
2 Correct 9 ms 2476 KB Output is correct
3 Correct 6 ms 2256 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 1 ms 604 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 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 1 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 5 ms 2008 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 4 ms 1628 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 1368 KB Output is correct
17 Correct 9 ms 2476 KB Output is correct
18 Correct 6 ms 2256 KB Output is correct
19 Correct 3 ms 1368 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 10 ms 3164 KB Output is correct
22 Correct 11 ms 3028 KB Output is correct
23 Correct 16 ms 5540 KB Output is correct
24 Correct 15 ms 3536 KB Output is correct
25 Correct 28 ms 6352 KB Output is correct