제출 #1349489

#제출 시각아이디문제언어결과실행 시간메모리
1349489mozkunLost Array (NOI19_lostarray)C++20
100 / 100
13 ms1852 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int inf = 1e5 + 5;

int a[inf], b[inf], c[inf];
int x[inf];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= n; i++) x[i] = 1;

    for (int i = 1; i <= m; i++) {
        cin >> a[i] >> b[i] >> c[i];
        x[a[i]] = max(x[a[i]], c[i]);
        x[b[i]] = max(x[b[i]], c[i]);
    }

    for (int i = 1; i <= m; i++) {
        if (min(x[a[i]], x[b[i]]) != c[i]) {
            return 0;
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << x[i] << (i == n ? '\n' : ' ');
    }

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...