Submission #68541759
Source Code Expand
#include <stdio.h>
int main(){
int N;
scanf("%d", &N);
int R[N], C[N];
for(int i = 0; i < N; i++){
scanf("%d %d", &R[i], &C[i]);
}
int Xmin=1000000000;
int Xmax=-1;
int Ymin=1000000000;
int Ymax=-1;
for(int i = 0; i < N; i++){
if(Xmin > R[i]){
Xmin = R[i];
}
if(Xmax < R[i]){
Xmax = R[i];
}
if(Ymin > C[i]){
Ymin = C[i];
}
if(Ymax < C[i]){
Ymax = C[i];
}
}
int answer = (Ymax - Ymin) > (Xmax - Xmin) ?((Ymax - Ymin) + 1) / 2 : ((Xmax - Xmin) + 1) / 2;
printf("%d\n", answer);
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | C - King's Summit |
| User | oinucha |
| Language | C (gcc 12.2.0) |
| Score | 300 |
| Code Size | 702 Byte |
| Status | AC |
| Exec Time | 41 ms |
| Memory | 3272 KiB |
Compile Error
Main.c: In function ‘main’:
Main.c:5:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
5 | scanf("%d", &N);
| ^~~~~~~~~~~~~~~
Main.c:8:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
8 | scanf("%d %d", &R[i], &C[i]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 300 / 300 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample00.txt, sample01.txt, sample02.txt |
| All | sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample00.txt | AC | 0 ms | 1572 KiB |
| sample01.txt | AC | 0 ms | 1640 KiB |
| sample02.txt | AC | 0 ms | 1620 KiB |
| testcase00.txt | AC | 0 ms | 1624 KiB |
| testcase01.txt | AC | 0 ms | 1708 KiB |
| testcase02.txt | AC | 0 ms | 1712 KiB |
| testcase03.txt | AC | 27 ms | 2656 KiB |
| testcase04.txt | AC | 40 ms | 3268 KiB |
| testcase05.txt | AC | 7 ms | 2040 KiB |
| testcase06.txt | AC | 25 ms | 3184 KiB |
| testcase07.txt | AC | 27 ms | 2892 KiB |
| testcase08.txt | AC | 34 ms | 3144 KiB |
| testcase09.txt | AC | 7 ms | 2024 KiB |
| testcase10.txt | AC | 34 ms | 3272 KiB |
| testcase11.txt | AC | 39 ms | 3076 KiB |
| testcase12.txt | AC | 23 ms | 2608 KiB |
| testcase13.txt | AC | 13 ms | 2200 KiB |
| testcase14.txt | AC | 1 ms | 1628 KiB |
| testcase15.txt | AC | 2 ms | 1764 KiB |
| testcase16.txt | AC | 17 ms | 2244 KiB |
| testcase17.txt | AC | 40 ms | 3260 KiB |
| testcase18.txt | AC | 40 ms | 3260 KiB |
| testcase19.txt | AC | 40 ms | 3156 KiB |
| testcase20.txt | AC | 40 ms | 3180 KiB |
| testcase21.txt | AC | 40 ms | 3196 KiB |
| testcase22.txt | AC | 41 ms | 3180 KiB |