結果

問題 No.652 E869120 and TimeZone
ユーザー yuya178yuya178
提出日時 2018-02-23 22:37:07
言語 Java21
(openjdk 21)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,760 bytes
コンパイル時間 2,728 ms
コンパイル使用メモリ 92,632 KB
実行使用メモリ 41,708 KB
最終ジャッジ日時 2024-05-09 19:56:14
合計ジャッジ時間 7,172 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
41,360 KB
testcase_01 AC 113 ms
41,024 KB
testcase_02 AC 99 ms
41,240 KB
testcase_03 AC 119 ms
41,580 KB
testcase_04 WA -
testcase_05 AC 117 ms
41,504 KB
testcase_06 AC 125 ms
41,236 KB
testcase_07 AC 126 ms
41,328 KB
testcase_08 AC 104 ms
41,156 KB
testcase_09 AC 103 ms
41,420 KB
testcase_10 AC 111 ms
41,328 KB
testcase_11 AC 124 ms
41,292 KB
testcase_12 AC 123 ms
41,096 KB
testcase_13 WA -
testcase_14 AC 104 ms
41,260 KB
testcase_15 AC 116 ms
41,448 KB
testcase_16 AC 113 ms
41,512 KB
testcase_17 AC 118 ms
41,708 KB
testcase_18 AC 122 ms
41,192 KB
testcase_19 AC 114 ms
40,236 KB
testcase_20 AC 124 ms
41,436 KB
testcase_21 AC 109 ms
41,052 KB
testcase_22 AC 125 ms
40,968 KB
testcase_23 AC 115 ms
41,532 KB
testcase_24 AC 102 ms
41,336 KB
testcase_25 AC 116 ms
41,404 KB
testcase_26 AC 118 ms
41,404 KB
testcase_27 AC 118 ms
41,404 KB
testcase_28 AC 117 ms
41,300 KB
testcase_29 AC 111 ms
41,460 KB
testcase_30 AC 97 ms
41,180 KB
testcase_31 AC 95 ms
41,308 KB
testcase_32 AC 106 ms
41,204 KB
testcase_33 AC 87 ms
41,400 KB
testcase_34 AC 102 ms
41,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main{
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    int mod = 1_000_000_007;
    long inf = Long.MAX_VALUE/5;

    void solve(){
        int a = ni();
        int b = ni();
        String s = ns();
        char[] c = s.toCharArray();
        int n = c.length;
        int time = a*60+b;
        double utc = 0;
        if(c[3]=='+') utc = Double.parseDouble(s.substring(4,n)) - 9;
        else utc = -Double.parseDouble(s.substring(4,n)) - 9;
        time += 60 * utc;
        time = (time+24*60)%(24*60);
        out.printf("%02d:%02d", time/60, time%60);
        out.println();

    } 

    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0