Submission #1152631
Source Code Expand
#include<bits/stdc++.h> #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; #define mygc(c) (c)=getchar_unlocked() #define mypc(c) putchar_unlocked(c) void reader(int *x) { int k, m = 0; *x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { *x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; *x = (*x) * 10 + k - '0'; }if (m)(*x) = -(*x); } void reader(int *x, int *y) { reader(x); reader(y); } void reader(int *x, int *y, int *z) { reader(x); reader(y); reader(z); } void writer(int x, char c) { int i, sz = 0, m = 0; char buf[10]; if (x<0)m = 1, x = -x; while (x)buf[sz++] = x % 10, x /= 10; if (!sz)buf[sz++] = 0; if (m)mypc('-'); while (sz--)mypc(buf[sz] + '0'); mypc(c); } int cnt[100001], s[100000], t[100000]; int main() { int n; reader(&n); rep(i, n) { reader(&s[i], &t[i]); s[i]--; t[i]--; cnt[s[i]]++; cnt[t[i]]--; } int Max = 0, mn = 0, mx = 0; rep(i, 100000) { cnt[i + 1] += cnt[i]; if (Max < cnt[i]) { Max = cnt[i]; mn = i; } if (Max == cnt[i])mx = i; } rep(i, n) { if (s[i] <= mn&&mx < t[i]) { writer(Max - 1, '\n'); return 0; } } writer(Max, '\n'); }
Submission Info
Submission Time | |
---|---|
Task | D - 足ゲームII |
User | autumn_eel |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1186 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 1408 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample-01.txt, sample-02.txt, sample-03.txt |
All | sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 640 KB |
01-02.txt | AC | 2 ms | 640 KB |
01-03.txt | AC | 2 ms | 640 KB |
01-04.txt | AC | 2 ms | 640 KB |
01-05.txt | AC | 5 ms | 1408 KB |
01-06.txt | AC | 5 ms | 1408 KB |
01-07.txt | AC | 5 ms | 1408 KB |
01-08.txt | AC | 5 ms | 1408 KB |
01-09.txt | AC | 5 ms | 1408 KB |
01-10.txt | AC | 2 ms | 640 KB |
01-11.txt | AC | 5 ms | 1408 KB |
01-12.txt | AC | 5 ms | 1408 KB |
01-13.txt | AC | 5 ms | 1408 KB |
01-14.txt | AC | 5 ms | 1408 KB |
01-15.txt | AC | 2 ms | 640 KB |
01-16.txt | AC | 5 ms | 1408 KB |
01-17.txt | AC | 5 ms | 1408 KB |
01-18.txt | AC | 5 ms | 1408 KB |
01-19.txt | AC | 5 ms | 1408 KB |
01-20.txt | AC | 2 ms | 640 KB |
01-21.txt | AC | 6 ms | 1408 KB |
01-22.txt | AC | 6 ms | 1408 KB |
01-23.txt | AC | 6 ms | 1408 KB |
01-24.txt | AC | 4 ms | 1408 KB |
01-25.txt | AC | 2 ms | 640 KB |
01-26.txt | AC | 2 ms | 640 KB |
01-27.txt | AC | 5 ms | 1408 KB |
01-28.txt | AC | 5 ms | 1408 KB |
sample-01.txt | AC | 2 ms | 640 KB |
sample-02.txt | AC | 2 ms | 640 KB |
sample-03.txt | AC | 2 ms | 640 KB |