結果
| 問題 | No.759 悪くない忘年会にしような！ |
| ユーザー |
 butsurizuki
|
| 提出日時 | 2018-12-07 01:11:09 |
| 言語 | C (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 841 ms / 2,000 ms |
| コード長 | 4,911 bytes |
| コンパイル時間 | 549 ms |
| コンパイル使用メモリ | 33,920 KB |
| 実行使用メモリ | 101,652 KB |
| 最終ジャッジ日時 | 2024-09-14 03:04:07 |
| 合計ジャッジ時間 | 10,972 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 64 |
コンパイルメッセージ
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.1415926535897932384int 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);}bool fl[10005][10005]={0};typedef struct{int xp;int yp;int zp;int bid;}sd;int sdsortfnc(const void *a,const void *b){if(((sd*)a)->xp < ((sd*)b)->xp){return 1;}if(((sd*)a)->xp > ((sd*)b)->xp){return -1;}if(((sd*)a)->yp < ((sd*)b)->yp){return 1;}if(((sd*)a)->yp > ((sd*)b)->yp){return -1;}if(((sd*)a)->zp < ((sd*)b)->zp){return 1;}if(((sd*)a)->zp > ((sd*)b)->zp){return -1;}return 0;}int main(void){int i,j,n,a,b,c,st,fi,r=0,w,te;int res[131072];sd dat[131072];scanf("%d",&n);for(i=0;i<n;i++){scanf("%d%d%d",&a,&b,&c);dat[i].xp=a;dat[i].yp=b;dat[i].zp=c;dat[i].bid=i+1;}qsort(dat,n,sizeof(dat[0]),sdsortfnc);st=0;for(i=10000;i>=0;i--){fi=st-1;if(st==n){break;}while(fi+1<n && dat[fi+1].xp==i){fi++;}if(fi<st){continue;}te=-1;for(j=st;j<=fi;j++){if(fl[dat[j].yp][dat[j].zp]==0){if(j!=st){if(dat[j-1].yp==dat[j].yp){continue;}if(dat[j].zp<=te){continue;}}res[r]=dat[j].bid;r++;te=max(te,dat[j].zp);}else{continue;}w=0;for(a=dat[j].yp;a>=0;a--){for(b=dat[j].zp;b>=w;b--){if(fl[a][b]==1){w=max(w,b+1);break;}else{fl[a][b]=1;}}if(dat[j].zp<w){break;}}}st=fi+1;}qsort(res,r,sizeof(int),sortfncsj);for(i=0;i<r;i++){printf("%d\n",res[i]);}return 0;}