Submission #1603481
Source Code Expand
#define _USE_MATH_DEFINES #include <iostream> #include <algorithm> #include <cmath> #include <string> #include <utility> #include <climits> #include <vector> #include <map> using namespace std; #define ll long long const int MOD = 1000000007;//10^9+7 int max(int a, int b) { if (a > b)return a; else return b; } //aとbの大きい方 int min(int a, int b) { if (a < b)return a; else return b; } //aとbの小さい方 int avd_i(int a, int b) { if (a > b)return a - b; else return b - a; } double avd_d(double a, double b) { double re; if (a > b)re = a - b; else re = b - a; return re; } //aとbの差の絶対値 ll powsur(ll a, ll b, ll p) { if (b == 0) { return 1; } else if (b % 2 == 0) { ll d = powsur(a, b / 2, p); return ((d%p)*(d%p)) % p; } else { return ((a%p)*powsur(a, b - 1, p) % p) % p; } } //pは素数,aのb乗をpで割った余り ll CMOD(ll n, ll r, ll p) { ll a = 1, b = 1, c = 1, re; for (int i = 1; i <= n; i++) { a *= i; a = a%p; } for (int i = 1; i <= r; i++) { b *= i; b = b%p; } for (int i = 1; i <= n - r; i++) { c *= i; c = c%p; } b = powsur(b, p - 2, p); c = powsur(c, p - 2, p); re = ((a%p)*(b%p)) % p; re = ((re%p)*c%p) % p; return re; } //pは素数,(nCr)%p int main() { int n, a[100005], b[100005], tmp[1000005], m = 0; for (int i = 0; i < 1000005; i++)tmp[i] = 0; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; tmp[a[i]]++; tmp[b[i] + 1]--; } m = tmp[0]; for (int i = 1; i < 1000005; i++) { tmp[i] = tmp[i] + tmp[i - 1]; m = max(m, tmp[i]); } cout << m << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | pelno |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1759 Byte |
Status | AC |
Exec Time | 91 ms |
Memory | 4992 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 | 4 ms | 4096 KB |
subtask0_sample02.txt | AC | 4 ms | 4096 KB |
subtask1_01.txt | AC | 4 ms | 4096 KB |
subtask1_02.txt | AC | 4 ms | 4096 KB |
subtask1_03.txt | AC | 5 ms | 4224 KB |
subtask1_04.txt | AC | 5 ms | 4224 KB |
subtask1_05.txt | AC | 5 ms | 4224 KB |
subtask1_06.txt | AC | 5 ms | 4224 KB |
subtask1_07.txt | AC | 5 ms | 4224 KB |
subtask1_08.txt | AC | 5 ms | 4224 KB |
subtask1_09.txt | AC | 5 ms | 4224 KB |
subtask1_10.txt | AC | 5 ms | 4224 KB |
subtask1_11.txt | AC | 5 ms | 4224 KB |
subtask1_12.txt | AC | 5 ms | 4224 KB |
subtask1_13.txt | AC | 5 ms | 4224 KB |
subtask1_14.txt | AC | 5 ms | 4224 KB |
subtask1_15.txt | AC | 5 ms | 4224 KB |
subtask2_01.txt | AC | 65 ms | 4992 KB |
subtask2_02.txt | AC | 83 ms | 4864 KB |
subtask2_03.txt | AC | 61 ms | 4864 KB |
subtask2_04.txt | AC | 79 ms | 4992 KB |
subtask2_05.txt | AC | 73 ms | 4992 KB |
subtask2_06.txt | AC | 84 ms | 4864 KB |
subtask2_07.txt | AC | 83 ms | 4992 KB |
subtask2_08.txt | AC | 85 ms | 4992 KB |
subtask2_09.txt | AC | 81 ms | 4992 KB |
subtask2_10.txt | AC | 83 ms | 4992 KB |
subtask2_11.txt | AC | 91 ms | 4864 KB |
subtask2_12.txt | AC | 83 ms | 4992 KB |
subtask2_13.txt | AC | 81 ms | 4992 KB |
subtask2_14.txt | AC | 84 ms | 4992 KB |
subtask2_15.txt | AC | 81 ms | 4992 KB |
subtask2_16.txt | AC | 83 ms | 4992 KB |
subtask2_17.txt | AC | 84 ms | 4992 KB |
subtask2_18.txt | AC | 82 ms | 4864 KB |
subtask2_19.txt | AC | 83 ms | 4864 KB |
subtask2_20.txt | AC | 83 ms | 4864 KB |
subtask2_21.txt | AC | 82 ms | 4864 KB |
subtask2_22.txt | AC | 82 ms | 4864 KB |
subtask2_23.txt | AC | 83 ms | 4992 KB |
subtask2_24.txt | AC | 86 ms | 4992 KB |
subtask2_25.txt | AC | 81 ms | 4992 KB |