제출 #525041

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
525041	2022-02-10 14:45:42	amunduzbaev	Worst Reporter 4 (JOI21_worst_reporter4)	C++17	14 / 100	202 ms	197028 KiB

worst_reporter2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "bits/stdc++.h"
using namespace std;
#define ar array
typedef long long ll;
const int N = 5005;
vector<int> edges[N];
int used[N], is[N];
ll dp[N][N], c[N];
int a[N], h[N];
signed main(){
  ios::sync_with_stdio(0); cin.tie(0);
  
  int n; cin>>n;
  vector<int> p(n);
  for(int i=0;i<n;i++){
    cin>>a[i]>>h[i]>>c[i];
    a[i]--; p[i] = i;
  } sort(p.begin(), p.end(), [&](int i, int j) { return (h[i] < h[j]); });
  for(int i=0, last=0;i<n;){
    int j = i;
    while(j<n && h[p[i]] == h[p[j]]) j++;
    while(i < j) h[p[i]] = last, i++;
    last++;
  }
  
  vector<vector<int>> cc;
  for(int i=0;i<n;i++){
    if(used[i]) continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 0 / 65
• Subtask 3: 0 / 21