oj.uz

Submission #1047072

# Submission time Handle Problem Language Result Execution time Memory
1047072 2024-08-07T08:32:36 Z Whisper Lost Array (NOI19_lostarray) C++17
11 / 100
 5 ms 7052 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<pair<int, int>> Q[MAX];

int A[MAX];

#define cs              1'000'000'000
int a[MAX], b[MAX], c[MAX];
void process(void){
    cin >> N >> M;
    for (int i = 1; i <= M; ++i){
        cin >> a[i] >> b[i] >> c[i];
        Q[a[i]].emplace_back(c[i], b[i]);
        Q[b[i]].emplace_back(c[i], a[i]);
    }
    for (int i = 1; i <= N; ++i) sort(Q[i].begin(), Q[i].end());
    for (int i = 1; i <= N; ++i){
        if (Q[i].empty()){
            A[i] = cs; continue;
        }
        while(Q[i].size()){
            if(A[Q[i].back().second]) Q[i].pop_back();
            else break;
        }
        A[i] = (Q[i].empty() ? cs : Q[i].back().first);
    }
    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 1 ms 5500 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 1 ms 5764 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 1 ms 5724 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5500 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 1 ms 5764 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 1 ms 5724 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 1 ms 5724 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5500 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 1 ms 5764 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 1 ms 5724 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 1 ms 5724 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Incorrect 1 ms 5724 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 7052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5500 KB Output is correct
2 Correct 1 ms 5724 KB Output is correct
3 Correct 1 ms 5764 KB Output is correct
4 Correct 1 ms 5724 KB Output is correct
5 Correct 1 ms 5724 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 1 ms 5724 KB Output is correct
8 Correct 5 ms 6492 KB Output is correct
9 Correct 1 ms 5724 KB Output is correct
10 Correct 4 ms 6492 KB Output is correct
11 Incorrect 1 ms 5724 KB Output isn't correct
12 Halted 0 ms 0 KB -