Submission #1367726
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <cmath> #include <numeric> #include <fstream> #include <queue> #include <cstdio> using namespace std; #define fol(i,n) for (int i=0;i<n;i++) #define db(a) cout << a<< endl; typedef pair <int,int>P; using namespace std; int main(){ int n,a,b,c=1000001,d=0; scanf("%d",&n); vector <int>A(c,0); fol(i,n){ cin >>a>>b; A[a]++; A[b+1]--; } d = A[0]; for(int i = 1;i<c;i++){ A[i]=A[i]+A[i-1]; d = max(d,A[i]); } printf("%d\n",d); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | ravie403 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 649 Byte |
Status | AC |
Exec Time | 68 ms |
Memory | 4224 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:19:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^
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 | 5 ms | 4096 KB |
subtask0_sample02.txt | AC | 5 ms | 4096 KB |
subtask1_01.txt | AC | 5 ms | 4096 KB |
subtask1_02.txt | AC | 5 ms | 4096 KB |
subtask1_03.txt | AC | 6 ms | 4096 KB |
subtask1_04.txt | AC | 6 ms | 4096 KB |
subtask1_05.txt | AC | 6 ms | 4096 KB |
subtask1_06.txt | AC | 6 ms | 4096 KB |
subtask1_07.txt | AC | 6 ms | 4096 KB |
subtask1_08.txt | AC | 6 ms | 4096 KB |
subtask1_09.txt | AC | 6 ms | 4096 KB |
subtask1_10.txt | AC | 6 ms | 4096 KB |
subtask1_11.txt | AC | 6 ms | 4224 KB |
subtask1_12.txt | AC | 6 ms | 4096 KB |
subtask1_13.txt | AC | 7 ms | 4096 KB |
subtask1_14.txt | AC | 6 ms | 4096 KB |
subtask1_15.txt | AC | 6 ms | 4096 KB |
subtask2_01.txt | AC | 55 ms | 4096 KB |
subtask2_02.txt | AC | 65 ms | 4096 KB |
subtask2_03.txt | AC | 52 ms | 4096 KB |
subtask2_04.txt | AC | 62 ms | 4096 KB |
subtask2_05.txt | AC | 59 ms | 4096 KB |
subtask2_06.txt | AC | 65 ms | 4096 KB |
subtask2_07.txt | AC | 65 ms | 4096 KB |
subtask2_08.txt | AC | 66 ms | 4096 KB |
subtask2_09.txt | AC | 66 ms | 4096 KB |
subtask2_10.txt | AC | 65 ms | 4096 KB |
subtask2_11.txt | AC | 65 ms | 4096 KB |
subtask2_12.txt | AC | 67 ms | 4096 KB |
subtask2_13.txt | AC | 65 ms | 4096 KB |
subtask2_14.txt | AC | 65 ms | 4096 KB |
subtask2_15.txt | AC | 66 ms | 4096 KB |
subtask2_16.txt | AC | 68 ms | 4096 KB |
subtask2_17.txt | AC | 66 ms | 4096 KB |
subtask2_18.txt | AC | 65 ms | 4096 KB |
subtask2_19.txt | AC | 65 ms | 4096 KB |
subtask2_20.txt | AC | 65 ms | 4096 KB |
subtask2_21.txt | AC | 66 ms | 4096 KB |
subtask2_22.txt | AC | 66 ms | 4096 KB |
subtask2_23.txt | AC | 65 ms | 4096 KB |
subtask2_24.txt | AC | 65 ms | 4096 KB |
subtask2_25.txt | AC | 65 ms | 4096 KB |