Submission #2930654
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <climits> #include <cmath> #include <complex> #include <map> #include <set> #include <vector> #include <stack> #include <queue> #include <bitset> #include <algorithm> #include <numeric> #include <functional> #include <cassert> #include <iomanip> using namespace std; #define Rep(b, e, i) for(int i = b; i <= e; i++) #define Repr(e, b, i) for(int i = e; i >= b; i--) #define rep(n, i) Rep(0, n-1, i) #define repr(n, i) Repr(n-1, 0, i) #define all(v) (v).begin(), (v).end() #define pb(v) push_back(v) #define uniq(v) (v).erase(unique(all(v)),(v).end()) #define bitcnt(x) __builtin_popcount(x) #define fst first #define snd second #define Pqaz(T) priority_queue<T,vector<T>,greater<T>> #define Pqza(T) priority_queue<T> #define put(x) cout << x; #define putsp(x) cout << x << ' '; #define putbd cout << "---------------------------------------------" << endl; #define putln(x) cout << x << endl; #define debug(x) cerr << #x << "=" << x << endl; #define ENJYU std::ios::sync_with_stdio(false);std::cin.tie(0); typedef long long ll; typedef pair<ll, ll> llP; typedef pair<int, int> intP; typedef complex<double> comp; typedef vector <int> vec; typedef vector <ll> vecll; typedef vector <double> vecd; typedef vector <vec> mat; typedef vector <vecll> matll; typedef vector <vecd> matd; //vector の中身を出力 template <class T>ostream &operator<<(ostream &o,const vector<T>&v) {o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;} const int MAX = 200020; const double PI = 3.14159265358979323846; const double EPS = 1e-12; const int INF = 1<<29; const ll INFL = 1e18; const int MOD = 1000000007; const int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; //const int dx[]={-1,-1,-1,0,1,1,1,0},dy[]={-1,0,1,1,1,0,-1,-1}; //********************************template END****************************************// void solve(void){ int N, M; cin >> N >> M; vector <intP> ps(2*N); rep(N, i) { int s, t; cin >> s >> t; if (s > t) { t += M; } ps[i] = intP(t, s); ps[i+N] = intP(t+M, s+M); } sort(all(ps)); int l = -INF, ans = 0; rep(N, i) { if (ps[i].snd >= l) { ans++; l = ps[i].fst; } } cout << ans << endl; } int main(void){ solve(); //cout << "yui(*-v・)yui" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Anime Master |
User | sifi_border |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2439 Byte |
Status | WA |
Exec Time | 77 ms |
Memory | 1792 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 2, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 3, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 4, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 5, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 6, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 7, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 8, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1 | AC | 1 ms | 256 KB |
10 | AC | 1 ms | 256 KB |
11 | AC | 1 ms | 256 KB |
12 | AC | 1 ms | 256 KB |
13 | AC | 1 ms | 256 KB |
14 | AC | 1 ms | 256 KB |
15 | AC | 1 ms | 256 KB |
16 | AC | 1 ms | 256 KB |
17 | AC | 1 ms | 256 KB |
18 | AC | 1 ms | 256 KB |
19 | AC | 1 ms | 256 KB |
2 | AC | 1 ms | 256 KB |
20 | AC | 1 ms | 256 KB |
21 | AC | 1 ms | 256 KB |
22 | AC | 1 ms | 256 KB |
23 | AC | 1 ms | 256 KB |
24 | AC | 1 ms | 256 KB |
25 | AC | 1 ms | 256 KB |
26 | AC | 1 ms | 256 KB |
27 | AC | 1 ms | 256 KB |
28 | AC | 1 ms | 256 KB |
29 | AC | 1 ms | 256 KB |
3 | AC | 1 ms | 256 KB |
30 | AC | 1 ms | 256 KB |
31 | AC | 1 ms | 256 KB |
32 | AC | 1 ms | 256 KB |
33 | AC | 1 ms | 256 KB |
34 | AC | 1 ms | 256 KB |
35 | AC | 1 ms | 256 KB |
36 | AC | 1 ms | 256 KB |
37 | AC | 1 ms | 256 KB |
38 | AC | 1 ms | 256 KB |
39 | AC | 1 ms | 256 KB |
4 | AC | 1 ms | 256 KB |
40 | AC | 1 ms | 256 KB |
41 | AC | 1 ms | 256 KB |
42 | AC | 1 ms | 256 KB |
43 | AC | 1 ms | 256 KB |
44 | AC | 1 ms | 256 KB |
45 | AC | 1 ms | 256 KB |
46 | AC | 1 ms | 256 KB |
47 | AC | 1 ms | 256 KB |
48 | AC | 1 ms | 256 KB |
49 | AC | 1 ms | 256 KB |
5 | AC | 1 ms | 256 KB |
50 | AC | 1 ms | 256 KB |
51 | AC | 1 ms | 256 KB |
52 | AC | 1 ms | 256 KB |
53 | AC | 1 ms | 256 KB |
54 | AC | 1 ms | 256 KB |
55 | AC | 1 ms | 256 KB |
56 | AC | 1 ms | 256 KB |
57 | AC | 1 ms | 256 KB |
58 | AC | 65 ms | 1792 KB |
59 | AC | 60 ms | 1792 KB |
6 | WA | 1 ms | 256 KB |
60 | WA | 67 ms | 1792 KB |
61 | AC | 77 ms | 1792 KB |
62 | AC | 76 ms | 1792 KB |
63 | AC | 76 ms | 1792 KB |
64 | WA | 77 ms | 1792 KB |
65 | WA | 21 ms | 640 KB |
66 | WA | 39 ms | 1024 KB |
67 | WA | 23 ms | 768 KB |
68 | WA | 4 ms | 384 KB |
69 | AC | 2 ms | 256 KB |
7 | AC | 1 ms | 256 KB |
70 | WA | 3 ms | 256 KB |
71 | AC | 1 ms | 256 KB |
72 | AC | 1 ms | 256 KB |
73 | AC | 1 ms | 256 KB |
74 | WA | 3 ms | 256 KB |
75 | WA | 4 ms | 256 KB |
76 | WA | 6 ms | 384 KB |
77 | WA | 4 ms | 256 KB |
78 | AC | 6 ms | 384 KB |
79 | AC | 3 ms | 256 KB |
8 | AC | 1 ms | 256 KB |
80 | AC | 3 ms | 384 KB |
81 | AC | 5 ms | 384 KB |
82 | AC | 4 ms | 384 KB |
83 | AC | 4 ms | 256 KB |
84 | AC | 8 ms | 384 KB |
85 | AC | 7 ms | 384 KB |
86 | AC | 4 ms | 256 KB |
87 | AC | 5 ms | 384 KB |
88 | AC | 4 ms | 384 KB |
89 | AC | 7 ms | 384 KB |
9 | AC | 1 ms | 256 KB |