結果
問題 | No.755 Zero-Sum Rectangle |
ユーザー | butsurizuki |
提出日時 | 2018-12-03 03:56:47 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 491 ms / 2,000 ms |
コード長 | 5,414 bytes |
コンパイル時間 | 335 ms |
コンパイル使用メモリ | 34,688 KB |
実行使用メモリ | 41,416 KB |
最終ジャッジ日時 | 2024-07-01 05:34:13 |
合計ジャッジ時間 | 7,819 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
41,416 KB |
testcase_01 | AC | 393 ms
36,788 KB |
testcase_02 | AC | 285 ms
36,644 KB |
testcase_03 | AC | 396 ms
36,824 KB |
testcase_04 | AC | 440 ms
36,640 KB |
testcase_05 | AC | 458 ms
36,964 KB |
testcase_06 | AC | 300 ms
36,836 KB |
testcase_07 | AC | 287 ms
36,676 KB |
testcase_08 | AC | 383 ms
36,660 KB |
testcase_09 | AC | 437 ms
36,648 KB |
testcase_10 | AC | 491 ms
36,784 KB |
testcase_11 | AC | 10 ms
34,576 KB |
evil_1 | TLE | - |
コンパイルメッセージ
main.c:16:5: warning: conflicting types for built-in function 'round'; expected 'double(double)' [-Wbuiltin-declaration-mismatch] 16 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} | ^~~~~ main.c:8:1: note: 'round' is declared in header '<math.h>' 7 | #include<time.h> +++ |+#include <math.h> 8 | #define inf 1072114514 main.c:17:5: warning: conflicting types for built-in function 'ceil'; expected 'double(double)' [-Wbuiltin-declaration-mismatch] 17 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} | ^~~~ main.c:17:5: note: 'ceil' is declared in header '<math.h>' main.c:23:5: warning: conflicting types for built-in function 'pow'; expected 'double(double, double)' [-Wbuiltin-declaration-mismatch] 23 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} | ^~~ main.c:23:5: note: 'pow' is declared in header '<math.h>' main.c:30:11: warning: conflicting types for built-in function 'llround'; expected 'long long int(double)' [-Wbuiltin-declaration-mismatch] 30 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} | ^~~~~~~ main.c:30:11: note: 'llround' is declared in header '<math.h>'
ソースコード
//set many funcs template //Ver.20180717 #include<stdio.h> #include<string.h> #include<stdlib.h> #include<stdbool.h> #include<time.h> #define inf 1072114514 #define llinf 4154118101919364364 #define mod 1000000007 #define pi 3.1415926535897932384 int max(int a,int b){if(a>b){return a;}return b;} int min(int a,int b){if(a<b){return a;}return b;} int zt(int a,int b){return max(a,b)-min(a,b);} int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;} int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;} int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} int nHr(int a,int b){return nCr(a+b-1,b);} int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;} int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;} int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;} int sankaku(int x){return ((1+x)*x)/2;} long long llmax(long long a,long long b){if(a>b){return a;}return b;} long long llmin(long long a,long long b){if(a<b){return a;}return b;} long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);} long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;} long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;} long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;} long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;} long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;} long long llnHr(long long a,long long b){return llnCr(a+b-1,b);} long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;} long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;} long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;} long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;} long long llsankaku(long long x){return ((1+x)*x)/2;} double dbmax(double a,double b){if(a>b){return a;}return b;} double dbmin(double a,double b){if(a<b){return a;}return b;} double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);} int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;} int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;} int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;} int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;} int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);} int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);} void shuffledget(int x[],int n){ srand(time(0)); int i,b[524288],p,c; for(i=0;i<n;i++){ b[i]=i; } for(i=n;i>=1;i--){ p=rand()%i; c=b[i-1];b[i-1]=b[p];b[p]=c; } for(i=0;i<n;i++){ scanf("%d",&x[b[i]]); } } int dx4[4]={1,-1,0,0}; int dy4[4]={0,0,1,-1}; int dx8[8]={-1,-1,-1,0,0,1,1,1}; int dy8[8]={-1,0,1,-1,1,-1,0,1}; int search(int x,int a[],int n){ int st=0,fi=n-1,te; while(st<=fi){ te=(st+fi)/2; if(a[te]<x){st=te+1;}else{fi=te-1;} } return st; } typedef struct{ int val; int node; }sd; int sdsortfnc(const void *a,const void *b){ if(((sd*)a)->val < ((sd*)b)->val){return -1;} if(((sd*)a)->val > ((sd*)b)->val){return 1;} return 0; } long long bsum[2048][2048]={0}; long long cbz(long long fx,long long fy,long long tx,long long ty){ if(fx>tx || fy>ty){return 0;} if(fx==0 && fy == 0){return bsum[tx][ty];} else if(fx==0){ return bsum[tx][ty]-bsum[tx][fy-1]; } else if(fy==0){ return bsum[tx][ty]-bsum[fx-1][ty]; } else{ return bsum[tx][ty]-bsum[tx][fy-1]-bsum[fx-1][ty]+bsum[fx-1][fy-1]; } } int main(void){ long long i,j,n,m,k,a,b,c,h,w,r=0,l,t; scanf("%lld%lld",&n,&m); long long bf[2048][2048]={0}; h=m;w=m; for(i=0;i<m;i++){ for(j=0;j<m;j++){scanf("%lld",&bf[i][j]);} } for(i=0;i<h;i++){ for(j=0;j<w;j++){ if(j==0){ bsum[i][j]=bf[i][j]; } else{ bsum[i][j]=bsum[i][j-1]+bf[i][j]; } } } for(i=0;i<h;i++){ for(j=0;j<w;j++){ if(i!=0){ bsum[i][j]=bsum[i-1][j]+bsum[i][j]; } } } for(t=0;t<n;t++){ scanf("%lld%lld",&a,&b); a--;b--; r=0; for(i=0;i<=a;i++){ for(j=a;j<m;j++){ for(k=0;k<=b;k++){ for(l=b;l<m;l++){ if(cbz(i,k,j,l)==0){r++;} } } } } printf("%lld\n",r); } return 0; }