Submission #2302859


Source Code Expand

#include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>

using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int p[n],q[n];
    for(int i=1;i<=n;i++)
    {
      scanf("%d-%d",&p[i],&q[i]);
    }
    int s[n],e[n];
    for(int i=1;i<=n;i++){
        s[i]=(p[i]/100)*60+p[i]%100;
        e[i]=(q[i]/100)*60+q[i]%100;
    }
    int t[289]={0};
    for(int i=1;i<=n;i++){
        for(int j=1;j<=288;j++){
            if(s[i]<(j*5)&&(e[i]+5)>j*5)
            t[j]=1;
        }
    }
    int i,m[1],l[1];
    i=1;
    while(i<=288){
        if(t[i]==0)
        i++;
        else {
            m[0]=i*5-5;
            while(t[i]==1)
            {
            i++;
            }
            m[1]=i*5-5;
            l[0]=(m[0]/60)*100+m[0]%60;
            l[1]=(m[1]/60)*100+m[1]%60;
            if(l[0]<10) cout<<"000"<<l[0];
            else if(l[0]<100) cout<<"00"<<l[0];
            else if(l[0]<1000)cout<<"0"<<l[0];
            else cout<<l[0];
            cout<<"-";
            if(l[1]<10) cout<<"000"<<l[1];
            else if(l[1]<100) cout<<"00"<<l[1];
            else if(l[1]<1000)cout<<"0"<<l[1];
            else cout<<l[1];
            cout<<endl;
        }
    }
return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User noimi
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1347 Byte
Status AC
Exec Time 15 ms
Memory 768 KB

Compile Error

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

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 15 ms 768 KB
chokudai_ga_cho.txt AC 15 ms 768 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 15 ms 768 KB
test_22.txt AC 14 ms 768 KB
test_23.txt AC 15 ms 768 KB
test_24.txt AC 14 ms 768 KB
test_25.txt AC 14 ms 768 KB
test_26.txt AC 14 ms 768 KB
test_27.txt AC 15 ms 768 KB
test_28.txt AC 15 ms 768 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 3 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 10 ms 512 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 15 ms 768 KB
test_37.txt AC 15 ms 768 KB
test_38.txt AC 14 ms 768 KB
test_39.txt AC 15 ms 768 KB
test_40.txt AC 15 ms 768 KB
test_41.txt AC 15 ms 768 KB
test_42.txt AC 15 ms 768 KB
test_43.txt AC 15 ms 768 KB