結果

問題 No.606 カラフルタイル
ユーザー butsurizukibutsurizuki
提出日時 2017-12-06 00:20:26
言語 C90
(gcc 11.4.0)
結果
AC  
実行時間 33 ms / 2,000 ms
コード長 3,390 bytes
コンパイル時間 1,113 ms
コンパイル使用メモリ 24,192 KB
実行使用メモリ 6,912 KB
最終ジャッジ日時 2024-05-06 12:23:08
合計ジャッジ時間 2,639 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
6,912 KB
testcase_01 AC 4 ms
6,912 KB
testcase_02 AC 3 ms
6,912 KB
testcase_03 AC 4 ms
6,784 KB
testcase_04 AC 4 ms
6,912 KB
testcase_05 AC 4 ms
6,912 KB
testcase_06 AC 4 ms
6,912 KB
testcase_07 AC 4 ms
6,784 KB
testcase_08 AC 3 ms
6,912 KB
testcase_09 AC 3 ms
6,912 KB
testcase_10 AC 4 ms
6,912 KB
testcase_11 AC 4 ms
6,784 KB
testcase_12 AC 4 ms
6,784 KB
testcase_13 AC 6 ms
6,912 KB
testcase_14 AC 4 ms
6,784 KB
testcase_15 AC 4 ms
6,784 KB
testcase_16 AC 21 ms
6,912 KB
testcase_17 AC 32 ms
6,784 KB
testcase_18 AC 21 ms
6,784 KB
testcase_19 AC 20 ms
6,912 KB
testcase_20 AC 33 ms
6,784 KB
testcase_21 AC 23 ms
6,912 KB
testcase_22 AC 23 ms
6,912 KB
testcase_23 AC 25 ms
6,912 KB
testcase_24 AC 30 ms
6,912 KB
testcase_25 AC 32 ms
6,912 KB
testcase_26 AC 31 ms
6,912 KB
testcase_27 AC 31 ms
6,784 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:14:5: warning: conflicting types for built-in function ‘round’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   14 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:6:1: note: ‘round’ is declared in header ‘<math.h>’
    5 | #include<stdbool.h>
  +++ |+#include <math.h>
    6 | #define inf 1072114514
main.c:15:5: warning: conflicting types for built-in function ‘ceil’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   15 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:15:5: note: ‘ceil’ is declared in header ‘<math.h>’
main.c:20:5: warning: conflicting types for built-in function ‘pow’; expected ‘double(double,  double)’ [-Wbuiltin-declaration-mismatch]
   20 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:20:5: note: ‘pow’ is declared in header ‘<math.h>’
main.c:24:11: warning: conflicting types for built-in function ‘llround’; expected ‘long long int(double)’ [-Wbuiltin-declaration-mismatch]
   24 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:24:11: note: ‘llround’ is declared in header ‘<math.h>’
main.c: In function ‘main’:
main.c:47:5: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   47 |     scanf("%lld%lld%lld",&n,&k,&q);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.c:50:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   50 |         scanf("%s%lld%lld",a[i],&b[i],&c[i]);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

//set many funcs template
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.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 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;}
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 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;}
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 main(void){
    long long i,n,k,q,b[131072],c[131072];
    char a[131072][2];
    long long res[131072]={0},m=0;
    long long rf[131072]={0},rc;
    long long cf[131072]={0},cc;
    scanf("%lld%lld%lld",&n,&k,&q);
    rc=n;cc=n;
    for(i=1;i<=q;i++){
        scanf("%s%lld%lld",a[i],&b[i],&c[i]);
    }
    for(i=q;i>=1;i--){
        if(a[i][0]=='R'){
            if(rf[b[i]]==1){continue;}
            rf[b[i]]=1;
            res[c[i]]+=cc;rc--;
        }
        else{
            if(cf[b[i]]==1){continue;}
            cf[b[i]]=1;
            res[c[i]]+=rc;cc--;
        }
    }
    for(i=k;i>=2;i--){
        m+=res[i];
    }
    res[1]=(n*n)-m;
    for(i=1;i<=k;i++){
        printf("%lld\n",res[i]);
    }
    return 0;
}
0