oj.uz

Submission #242021

# Submission time Handle Problem Language Result Execution time Memory
242021 2020-06-26T14:41:15 Z AmineWeslati Lost Array (NOI19_lostarray) C++14
100 / 100
 38 ms 2808 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 if(t[j]<x) t[i]=t[j]=x;
         else if(t[j]>x) t[i]=x;
      }
      else if(t[j]==-1){
         if(t[i]==x) t[j]=x;
         else if(t[i]<x) t[j]=t[i]=x;
         else if(t[i]>x) 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 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 6 ms 384 KB Output is correct
8 Correct 15 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 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 6 ms 384 KB Output is correct
8 Correct 15 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 384 KB Output is correct
2 Correct 13 ms 384 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 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 6 ms 384 KB Output is correct
8 Correct 15 ms 1152 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 11 ms 1024 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 13 ms 384 KB Output is correct
18 Correct 11 ms 384 KB Output is correct
19 Correct 9 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 21 ms 1664 KB Output is correct
22 Correct 23 ms 1664 KB Output is correct
23 Correct 29 ms 1656 KB Output is correct
24 Correct 27 ms 2168 KB Output is correct
25 Correct 38 ms 2808 KB Output is correct