#206010 (C++11) No.568 じゃんじゃん 落とす 委員会

• 問題: No.568 じゃんじゃん 落とす 委員会
• ユーザー: tnakao0123
• 提出日時: 2017-09-22 12:58:52
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 42 ms / 1,000 ms
• コード長: 1,747 bytes
• コンパイル時間: 651 ms
• コンパイル使用メモリ: 89,032 KB
• 実行使用メモリ: 5,760 KB
• 最終ジャッジ日時: 2024-11-30 11:13:54
• 合計ジャッジ時間: 2,205 ms
• ジャッジサーバーID （参考情報）: judge3 / judge5

ファイルパターン	結果
other	AC * 26

コンパイルメッセージ

main.cpp: In function ‘int main()’:
main.cpp:49:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   49 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
main.cpp:53:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   53 |     scanf("%d%d%d", &xi, &ai, &bi);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/* -*- coding: utf-8 -*-
 *
 * 568.cc: No.568 じゃんじゃん　落とす　委員会 - yukicoder
 */
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;
/* constant */
const int MAX_N = 100000;
const int MAX_A = 100000;
const int MAX_B = 100000;
const int INF = 1 << 30;
/* typedef */
typedef pair<int,int> pii;
/* global variables */
int xs[MAX_N];
pii aps[MAX_N], bps[MAX_N];
/* subroutines */
/* main */
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    int xi, ai, bi;
    scanf("%d%d%d", &xi, &ai, &bi);
    xs[i] = xi;
    aps[i] = pii(ai, i);
    bps[i] = pii(bi, i);
  }
  sort(aps, aps + n);
  sort(bps, bps + n);
  int n2 = 0, n3 = 0;
  for (int i = 0; i < n; i++) {
    xs[i]++;
    if (xs[i] >= 2) {
      n2++;
      if (xs[i] >= 3) n3++;
    }
  }
  //printf("n2=%d, n3=%d\n", n2, n3);
  int sa = 0, sb = MAX_B + 1;
  int minn3 = INF;
  for (int ai = 0, bi = n;;) {
    //printf("ai=%d, bi=%d\n", ai, bi);
    while (bi > 0 && n2 < m) {
      sb--;
      while (bi > 0 && bps[bi - 1].first >= sb) {
    bi--;
    int &k = bps[bi].second;
    xs[k]++;
    if (xs[k] == 3) n3++;
    else if (xs[k] == 2) n2++;
      }
    }
    if (n2 >= m && minn3 > n3) minn3 = n3;
    if (ai >= n) break;
    while (ai < n && aps[ai].first <= sa) {
      int &k = aps[ai].second;
      if (xs[k] == 3) n3--;
      else if (xs[k] == 2) n2--;
      xs[k]--;
      ai++;
    }
    sa++;
  }
  printf("%d\n", minn3);
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX