oj.uz

답안 #242020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242020 2020-06-26T14:34:22 Z AmineWeslati Lost Array (NOI19_lostarray) C++14
32 / 100
 17 ms 1152 KB 
//Never stop trying
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0}; //right left down up

int32_t main(){
   boost;
   int N,M; cin>>N>>M;
   int t[N];
   for(int i=0; i<N; i++) t[i]=-1;

   while(M--){
      int i,j,x; cin>>i>>j>>x;
      i--, j--;
      if(t[i]==-1 && t[j]==-1) t[i]=t[j]=x;
      else if(t[i]==-1){
         if(t[j]<=x) t[i]=x;
         else t[i]=t[j]=x;
      }
      else if(t[j]==-1){
         if(t[j]<=x) t[i]=x;
         else t[i]=t[j]=x;
      }
      else{
         if(t[i]<x) t[i]=x;
         if(t[j]<x) t[j]=x;
      }
   }
   for(int i=0; i<N; i++){
      if(t[i]==-1) cout << 1 << ' ';
      else cout << t[i] << ' ';
   }


   return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 10 ms 1024 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 10 ms 1024 KB Output is correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 512 KB Output is correct
2 Correct 14 ms 640 KB Output is correct
3 Correct 17 ms 512 KB Output is correct
4 Correct 8 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #5
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 11 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 10 ms 1024 KB Output is correct
11 Incorrect 5 ms 384 KB Output isn't correct
12 Halted 0 ms 0 KB -