제출 #1170596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170596		Bzslayed	Lost Array (NOI19_lostarray)	C++20	100 / 100	15 ms	1096 KiB

lostarray

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace std;
using namespace __gnu_pbds; 

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define coutpair(p) cout << p.first << " " << p.second << "|"

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll n, m; cin >> n >> m;
    ll x[n+5];
    memset(x, 0, sizeof(x));
    
    for (int i=0; i<m; i++){
        ll a, b, c; cin >> a >> b >> c;
        x[a] = max(x[a], c);
        x[b] = max(x[b], c);
    }

    for (int i=1; i<=n; i++) cout << ((x[i] == 0) ? 1 : x[i]) << " ";

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 6 / 6
• Subtask 3: 20 / 20
• Subtask 4: 21 / 21
• Subtask 5: 48 / 48