Submission #1625003
Source Code Expand
#include <iostream> #include <algorithm> #include <array> #include <math.h> #include <set> #include <stdlib.h> #include <string> #include <vector> #define INT_MAX 2000000000 #define MOD 1000000007 #define ll long long #define rep(i,a,b) for(i = (a); i < (b); i++) #define bitget(a,b) (((a) >> (b)) & 1) using namespace std; int i, j, k; int main() { int n; cin >> n; int a[100000], b[100000]; rep(i, 0, n) cin >> a[i] >> b[i]; int c[100002] = {}; rep(i, 0, n) { c[a[i]]++; c[b[i] + 1]--; } int m = c[0]; rep(i, 1, 1000002) { c[i] += c[i - 1]; if (c[i] > m) { m = c[i]; } } cout << m << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | noshi91 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 673 Byte |
Status | RE |
Exec Time | 198 ms |
Memory | 1408 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:33:19: warning: iteration 100001u invokes undefined behavior [-Waggressive-loop-optimizations] c[i] += c[i - 1]; ^ ./Main.cpp:13:35: note: containing loop #define rep(i,a,b) for(i = (a); i < (b); i++) ^ ./Main.cpp:32:2: note: in expansion of macro ‘rep’ rep(i, 1, 1000002) { ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 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 | RE | 102 ms | 640 KB |
subtask0_sample02.txt | RE | 102 ms | 640 KB |
subtask1_01.txt | RE | 101 ms | 640 KB |
subtask1_02.txt | RE | 101 ms | 640 KB |
subtask1_03.txt | RE | 103 ms | 640 KB |
subtask1_04.txt | RE | 102 ms | 640 KB |
subtask1_05.txt | RE | 103 ms | 640 KB |
subtask1_06.txt | RE | 102 ms | 640 KB |
subtask1_07.txt | RE | 101 ms | 640 KB |
subtask1_08.txt | RE | 103 ms | 640 KB |
subtask1_09.txt | RE | 105 ms | 640 KB |
subtask1_10.txt | RE | 103 ms | 640 KB |
subtask1_11.txt | RE | 104 ms | 640 KB |
subtask1_12.txt | RE | 104 ms | 640 KB |
subtask1_13.txt | RE | 114 ms | 640 KB |
subtask1_14.txt | RE | 110 ms | 640 KB |
subtask1_15.txt | RE | 118 ms | 640 KB |
subtask2_01.txt | RE | 172 ms | 1408 KB |
subtask2_02.txt | RE | 186 ms | 1408 KB |
subtask2_03.txt | RE | 164 ms | 1408 KB |
subtask2_04.txt | RE | 182 ms | 1408 KB |
subtask2_05.txt | RE | 178 ms | 1408 KB |
subtask2_06.txt | RE | 182 ms | 1408 KB |
subtask2_07.txt | RE | 182 ms | 1408 KB |
subtask2_08.txt | RE | 187 ms | 1408 KB |
subtask2_09.txt | RE | 180 ms | 1408 KB |
subtask2_10.txt | RE | 181 ms | 1408 KB |
subtask2_11.txt | RE | 198 ms | 1408 KB |
subtask2_12.txt | RE | 196 ms | 1408 KB |
subtask2_13.txt | RE | 184 ms | 1408 KB |
subtask2_14.txt | RE | 180 ms | 1408 KB |
subtask2_15.txt | RE | 181 ms | 1408 KB |
subtask2_16.txt | RE | 180 ms | 1408 KB |
subtask2_17.txt | RE | 182 ms | 1408 KB |
subtask2_18.txt | RE | 180 ms | 1408 KB |
subtask2_19.txt | RE | 179 ms | 1408 KB |
subtask2_20.txt | RE | 179 ms | 1408 KB |
subtask2_21.txt | RE | 178 ms | 1408 KB |
subtask2_22.txt | RE | 179 ms | 1408 KB |
subtask2_23.txt | RE | 182 ms | 1408 KB |
subtask2_24.txt | RE | 181 ms | 1408 KB |
subtask2_25.txt | RE | 180 ms | 1408 KB |