제출 #565272

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
565272		SSRS	Election Campaign (JOI15_election_campaign)	C++14	0 / 100	130 ms	4188 KiB

election_campaign

#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int X, Y;
    cin >> X >> Y;
  }
  int M;
  cin >> M;
  vector<int> A(M), B(M);
  for (int i = 0; i < M; i++){
    int C;
    cin >> A[i] >> B[i] >> C;
    if (A[i] > B[i]){
      swap(A[i], B[i]);
    }
    A[i]--;
  }
  vector<pair<int, int>> P(M);
  for (int i = 0; i < M; i++){
    P[i] = make_pair(B[i], A[i]);
  }
  sort(P.begin(), P.end());
  int p = -1;
  int ans = 0;
  for (int i = 0; i < M; i++){
    if (P[i].second > p){
      p = P[i].first;
      ans++;
    }
  }
  cout << ans << endl;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 30
• Subtask 5: 0 / 10
• Subtask 6: 0 / 40