Submission #5881902
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long #define FOR(i, a, b) for(ll i = (a); i < (b); ++i) #define FORR(i, a, b) for(ll i = (a); i > (b); --i) #define REP(i, n) for(ll i = 0; i < (n); ++i) #define REPR(i, n) for(ll i = n; i >= 0; i--) #define FOREACH(x, a) for(auto &(x) : (a)) #define VECCIN(x) \ for(auto &youso_ : (x)) cin >> youso_ #define bitcnt __builtin_popcount #define SZ(x) ((ll)(x).size()) #define fi first #define se second #define All(a) (a).begin(), (a).end() template <typename T = long long> inline T IN() { T x; cin >> x; return (x); } inline void CIN() {} template <class Head, class... Tail> inline void CIN(Head &&head, Tail &&... tail) { cin >> head; CIN(move(tail)...); } #define CINT(...) \ int __VA_ARGS__; \ CIN(__VA_ARGS__) #define LCIN(...) \ ll __VA_ARGS__; \ CIN(__VA_ARGS__) #define SCIN(...) \ string __VA_ARGS__; \ CIN(__VA_ARGS__) #define Yes(a) cout << (a ? "Yes" : "No") << "\n" #define YES(a) cout << (a ? "YES" : "NO") << "\n" #define Printv(v) \ { \ FOREACH(x, v) { cout << x << " "; } \ cout << "\n"; \ } template <typename T = string> inline void eputs(T s) { cout << s << "\n"; exit(0); } template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { std::fill((T *)array, (T *)(array + N), val); } typedef long long ll; typedef unsigned long long ul; typedef vector<ll> VL; typedef pair<ll, ll> PL; typedef priority_queue<ll> PQ; typedef priority_queue<ll, VL, greater<ll>> PQG; const int INF = 1e9; const int MOD = 1e9 + 7; // const int MOD = 998244353; const ll LINF = 1e18 + 1; const ll dx[] = {1, -1, 0, 0}; const ll dy[] = {0, 0, 1, -1}; ll N; ll sum[10000001]; VL cmp; signed main() { cin >> N; REP(i, N) { LCIN(a, b); sum[a]++; sum[b + 1]--; cmp.emplace_back(a); cmp.emplace_back(b + 1); } sort(All(cmp)); cmp.erase(unique(All(cmp)), cmp.end()); REP(i, cmp.size() - 1) { sum[cmp[i + 1]] += sum[cmp[i]]; } ll ans = 0; REP(i, cmp.size()) ans = max(sum[cmp[i]], ans); cout << ans << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | arktan763 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2881 Byte |
Status | AC |
Exec Time | 86 ms |
Memory | 11636 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 1 ms | 256 KB |
subtask0_sample02.txt | AC | 2 ms | 2304 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 3 ms | 2304 KB |
subtask1_04.txt | AC | 3 ms | 2432 KB |
subtask1_05.txt | AC | 3 ms | 2304 KB |
subtask1_06.txt | AC | 3 ms | 2432 KB |
subtask1_07.txt | AC | 2 ms | 384 KB |
subtask1_08.txt | AC | 4 ms | 8192 KB |
subtask1_09.txt | AC | 5 ms | 8192 KB |
subtask1_10.txt | AC | 4 ms | 8192 KB |
subtask1_11.txt | AC | 5 ms | 8192 KB |
subtask1_12.txt | AC | 5 ms | 8192 KB |
subtask1_13.txt | AC | 5 ms | 8320 KB |
subtask1_14.txt | AC | 5 ms | 8192 KB |
subtask1_15.txt | AC | 5 ms | 8192 KB |
subtask2_01.txt | AC | 56 ms | 4468 KB |
subtask2_02.txt | AC | 69 ms | 4980 KB |
subtask2_03.txt | AC | 56 ms | 4468 KB |
subtask2_04.txt | AC | 69 ms | 4980 KB |
subtask2_05.txt | AC | 60 ms | 2932 KB |
subtask2_06.txt | AC | 85 ms | 10612 KB |
subtask2_07.txt | AC | 86 ms | 10612 KB |
subtask2_08.txt | AC | 84 ms | 10612 KB |
subtask2_09.txt | AC | 84 ms | 10612 KB |
subtask2_10.txt | AC | 83 ms | 10612 KB |
subtask2_11.txt | AC | 84 ms | 10612 KB |
subtask2_12.txt | AC | 83 ms | 10612 KB |
subtask2_13.txt | AC | 83 ms | 10612 KB |
subtask2_14.txt | AC | 82 ms | 10612 KB |
subtask2_15.txt | AC | 85 ms | 10612 KB |
subtask2_16.txt | AC | 84 ms | 11636 KB |
subtask2_17.txt | AC | 85 ms | 10612 KB |
subtask2_18.txt | AC | 83 ms | 10612 KB |
subtask2_19.txt | AC | 85 ms | 10612 KB |
subtask2_20.txt | AC | 84 ms | 10612 KB |
subtask2_21.txt | AC | 84 ms | 10612 KB |
subtask2_22.txt | AC | 85 ms | 10612 KB |
subtask2_23.txt | AC | 85 ms | 10612 KB |
subtask2_24.txt | AC | 85 ms | 10612 KB |
subtask2_25.txt | AC | 84 ms | 10612 KB |