Submission #2203059


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int n;
struct point{
    int x,y;
}p[10010];
int sum;
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        scanf("%d%d",&p[i].x,&p[i].y);
    }
    int tmp=0;
    for(int i=0;i<n;++i){
        for(int j=i+1;j<n;++j){
            tmp=abs(p[i].x-p[j].x)*abs(p[i].y-p[j].y);
            sum=max(sum,tmp);
        }
    }
    cout<<sum<<endl;
    return 0;
}

Submission Info

Submission Time
Task F - 最後の問題
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 412 Byte
Status WA
Exec Time 108 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:9:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:11:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&p[i].x,&p[i].y);
                                      ^

Judge Result

Set Name sub1 sub2 sub3
Score / Max Score 0 / 10 0 / 20 0 / 70
Status
AC × 2
WA × 14
AC × 3
WA × 26
AC × 3
WA × 36
Set Name Test Cases
sub1 sub1/input_0.txt, sub1/input_1.txt, sub1/input_10.txt, sub1/input_11.txt, sub1/input_12.txt, sub1/input_13.txt, sub1/input_14.txt, sub1/input_15.txt, sub1/input_2.txt, sub1/input_3.txt, sub1/input_4.txt, sub1/input_5.txt, sub1/input_6.txt, sub1/input_7.txt, sub1/input_8.txt, sub1/input_9.txt
sub2 sub2/input_0.txt, sub2/input_1.txt, sub2/input_10.txt, sub2/input_11.txt, sub2/input_12.txt, sub2/input_13.txt, sub2/input_14.txt, sub2/input_15.txt, sub2/input_16.txt, sub2/input_17.txt, sub2/input_18.txt, sub2/input_19.txt, sub2/input_2.txt, sub2/input_20.txt, sub2/input_21.txt, sub2/input_22.txt, sub2/input_23.txt, sub2/input_24.txt, sub2/input_25.txt, sub2/input_26.txt, sub2/input_27.txt, sub2/input_28.txt, sub2/input_3.txt, sub2/input_4.txt, sub2/input_5.txt, sub2/input_6.txt, sub2/input_7.txt, sub2/input_8.txt, sub2/input_9.txt
sub3 sub3/input_0.txt, sub3/input_1.txt, sub3/input_10.txt, sub3/input_10k_0.txt, sub3/input_10k_1.txt, sub3/input_10k_2.txt, sub3/input_10k_3.txt, sub3/input_10k_4.txt, sub3/input_10k_5.txt, sub3/input_10k_6.txt, sub3/input_10k_7.txt, sub3/input_10k_8.txt, sub3/input_10k_9.txt, sub3/input_11.txt, sub3/input_12.txt, sub3/input_13.txt, sub3/input_14.txt, sub3/input_15.txt, sub3/input_16.txt, sub3/input_17.txt, sub3/input_18.txt, sub3/input_19.txt, sub3/input_2.txt, sub3/input_20.txt, sub3/input_21.txt, sub3/input_22.txt, sub3/input_23.txt, sub3/input_24.txt, sub3/input_25.txt, sub3/input_26.txt, sub3/input_27.txt, sub3/input_28.txt, sub3/input_3.txt, sub3/input_4.txt, sub3/input_5.txt, sub3/input_6.txt, sub3/input_7.txt, sub3/input_8.txt, sub3/input_9.txt
Case Name Status Exec Time Memory
sub1/input_0.txt AC 1 ms 256 KB
sub1/input_1.txt AC 1 ms 256 KB
sub1/input_10.txt WA 1 ms 256 KB
sub1/input_11.txt WA 1 ms 256 KB
sub1/input_12.txt WA 1 ms 256 KB
sub1/input_13.txt WA 1 ms 256 KB
sub1/input_14.txt WA 1 ms 256 KB
sub1/input_15.txt WA 1 ms 256 KB
sub1/input_2.txt WA 1 ms 256 KB
sub1/input_3.txt WA 1 ms 256 KB
sub1/input_4.txt WA 1 ms 256 KB
sub1/input_5.txt WA 1 ms 256 KB
sub1/input_6.txt WA 1 ms 256 KB
sub1/input_7.txt WA 1 ms 256 KB
sub1/input_8.txt WA 1 ms 256 KB
sub1/input_9.txt WA 1 ms 256 KB
sub2/input_0.txt AC 1 ms 256 KB
sub2/input_1.txt AC 1 ms 256 KB
sub2/input_10.txt WA 1 ms 256 KB
sub2/input_11.txt WA 1 ms 256 KB
sub2/input_12.txt WA 1 ms 256 KB
sub2/input_13.txt WA 1 ms 256 KB
sub2/input_14.txt WA 1 ms 256 KB
sub2/input_15.txt WA 1 ms 256 KB
sub2/input_16.txt WA 2 ms 256 KB
sub2/input_17.txt WA 2 ms 256 KB
sub2/input_18.txt WA 2 ms 256 KB
sub2/input_19.txt WA 2 ms 256 KB
sub2/input_2.txt WA 1 ms 256 KB
sub2/input_20.txt WA 2 ms 256 KB
sub2/input_21.txt WA 2 ms 256 KB
sub2/input_22.txt WA 2 ms 256 KB
sub2/input_23.txt WA 2 ms 256 KB
sub2/input_24.txt WA 2 ms 256 KB
sub2/input_25.txt AC 2 ms 256 KB
sub2/input_26.txt WA 2 ms 256 KB
sub2/input_27.txt WA 2 ms 256 KB
sub2/input_28.txt WA 2 ms 256 KB
sub2/input_3.txt WA 1 ms 256 KB
sub2/input_4.txt WA 1 ms 256 KB
sub2/input_5.txt WA 1 ms 256 KB
sub2/input_6.txt WA 1 ms 256 KB
sub2/input_7.txt WA 1 ms 256 KB
sub2/input_8.txt WA 1 ms 256 KB
sub2/input_9.txt WA 1 ms 256 KB
sub3/input_0.txt AC 1 ms 256 KB
sub3/input_1.txt AC 1 ms 256 KB
sub3/input_10.txt WA 1 ms 256 KB
sub3/input_10k_0.txt WA 108 ms 256 KB
sub3/input_10k_1.txt WA 108 ms 256 KB
sub3/input_10k_2.txt WA 107 ms 384 KB
sub3/input_10k_3.txt WA 108 ms 384 KB
sub3/input_10k_4.txt WA 104 ms 256 KB
sub3/input_10k_5.txt WA 104 ms 256 KB
sub3/input_10k_6.txt WA 108 ms 384 KB
sub3/input_10k_7.txt WA 108 ms 384 KB
sub3/input_10k_8.txt WA 108 ms 384 KB
sub3/input_10k_9.txt WA 108 ms 384 KB
sub3/input_11.txt WA 1 ms 256 KB
sub3/input_12.txt WA 1 ms 256 KB
sub3/input_13.txt WA 1 ms 256 KB
sub3/input_14.txt WA 1 ms 256 KB
sub3/input_15.txt WA 1 ms 256 KB
sub3/input_16.txt WA 2 ms 256 KB
sub3/input_17.txt WA 2 ms 256 KB
sub3/input_18.txt WA 2 ms 256 KB
sub3/input_19.txt WA 2 ms 256 KB
sub3/input_2.txt WA 1 ms 256 KB
sub3/input_20.txt WA 2 ms 256 KB
sub3/input_21.txt WA 2 ms 256 KB
sub3/input_22.txt WA 2 ms 256 KB
sub3/input_23.txt WA 2 ms 256 KB
sub3/input_24.txt WA 2 ms 256 KB
sub3/input_25.txt AC 2 ms 256 KB
sub3/input_26.txt WA 2 ms 256 KB
sub3/input_27.txt WA 2 ms 256 KB
sub3/input_28.txt WA 2 ms 256 KB
sub3/input_3.txt WA 1 ms 256 KB
sub3/input_4.txt WA 1 ms 256 KB
sub3/input_5.txt WA 1 ms 256 KB
sub3/input_6.txt WA 1 ms 256 KB
sub3/input_7.txt WA 1 ms 256 KB
sub3/input_8.txt WA 1 ms 256 KB
sub3/input_9.txt WA 1 ms 256 KB