結果

問題 No.759 悪くない忘年会にしような！
ユーザー butsurizukibutsurizuki
提出日時 2018-12-07 01:11:09
言語 C
(gcc 12.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
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,940 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 1 ms
6,940 KB
testcase_15 AC 1 ms
6,940 KB
testcase_16 AC 1 ms
6,940 KB
testcase_17 AC 1 ms
6,940 KB
testcase_18 AC 1 ms
6,940 KB
testcase_19 AC 1 ms
6,940 KB
testcase_20 AC 1 ms
6,944 KB
testcase_21 AC 1 ms
6,940 KB
testcase_22 AC 1 ms
6,944 KB
testcase_23 AC 1 ms
6,940 KB
testcase_24 AC 1 ms
6,940 KB
testcase_25 AC 1 ms
6,940 KB
testcase_26 AC 1 ms
6,944 KB
testcase_27 AC 1 ms
6,940 KB
testcase_28 AC 1 ms
6,940 KB
testcase_29 AC 1 ms
6,940 KB
testcase_30 AC 1 ms
6,944 KB
testcase_31 AC 1 ms
6,944 KB
testcase_32 AC 1 ms
6,940 KB
testcase_33 AC 177 ms
99,840 KB
testcase_34 AC 174 ms
99,584 KB
testcase_35 AC 174 ms
99,840 KB
testcase_36 AC 178 ms
99,840 KB
testcase_37 AC 169 ms
99,328 KB
testcase_38 AC 175 ms
99,584 KB
testcase_39 AC 175 ms
99,456 KB
testcase_40 AC 175 ms
99,712 KB
testcase_41 AC 174 ms
99,840 KB
testcase_42 AC 177 ms
99,712 KB
testcase_43 AC 176 ms
99,712 KB
testcase_44 AC 219 ms
101,140 KB
testcase_45 AC 221 ms
101,136 KB
testcase_46 AC 221 ms
101,268 KB
testcase_47 AC 219 ms
101,012 KB
testcase_48 AC 226 ms
101,144 KB
testcase_49 AC 181 ms
99,712 KB
testcase_50 AC 177 ms
99,584 KB
testcase_51 AC 171 ms
99,584 KB
testcase_52 AC 172 ms
99,712 KB
testcase_53 AC 220 ms
101,140 KB
testcase_54 AC 227 ms
101,140 KB
testcase_55 AC 220 ms
101,140 KB
testcase_56 AC 221 ms
101,144 KB
testcase_57 AC 226 ms
101,128 KB
testcase_58 AC 219 ms
101,016 KB
testcase_59 AC 219 ms
101,496 KB
testcase_60 AC 224 ms
101,016 KB
testcase_61 AC 218 ms
101,140 KB
testcase_62 AC 213 ms
101,016 KB
testcase_63 AC 782 ms
84,884 KB
testcase_64 AC 770 ms
84,760 KB
testcase_65 AC 216 ms
101,140 KB
testcase_66 AC 841 ms
101,652 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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>'

ソースコード

diff # 

//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);}

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;
}
0