結果
問題 | No.146 試験監督(1) |
ユーザー |
![]() |
提出日時 | 2015-02-08 23:43:20 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 385 ms / 1,000 ms |
コード長 | 3,100 bytes |
コンパイル時間 | 2,462 ms |
コンパイル使用メモリ | 77,992 KB |
実行使用メモリ | 48,436 KB |
最終ジャッジ日時 | 2024-06-23 07:48:59 |
合計ジャッジ時間 | 4,532 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 3 |
ソースコード
import java.io.BufferedReader;import java.io.FileInputStream;import java.io.FileNotFoundException;import java.io.IOException;import java.io.InputStreamReader;import java.util.ArrayList;import java.util.Arrays;import java.util.Comparator;import java.util.List;import java.util.PriorityQueue;public class Main {public static void main(String[] args) throws NumberFormatException, IOException{ContestScanner in = new ContestScanner();int n = in.nextInt();long count = 0;long max = 1000000007L;for(int i=0; i<n; i++){long c = in.nextLong();long d = in.nextLong();long val = c%2L==0?c/2L:(c/2L+1L);if(val >= max) val %= max;if(d >= max) d %= max;count += val*d;if(count >= max){count %= max;}}System.out.println(count);}}class MyComp implements Comparator<int[]>{public int compare(int[] a, int[] b) {return a[0] - b[0];}}////class Reverse implements Comparator<Integer>{// public int compare(Integer arg0, Integer arg1) {// return arg1 - arg0;// }//}class Node{int id;List<Node> edge = new ArrayList<Node>();public Node(int id){this.id = id;}public void createEdge(Node node){edge.add(node);}}class MyMath{public final static double PIhalf = Math.PI/2.0;public static double pAngle(double x, double y){// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)if(x == 0){if(y == 0){System.err.println("pAngle error: zero vector.");return 0;}else if(y < 0){return PIhalf*3.0;}else{return PIhalf;}}double rad = Math.atan(y/x);if(rad < 0){rad += Math.PI*2.0;}return rad;}public static long fact(long n){long res = 1;while(n > 0){res *= n--;}return res;}public static long[][] pascalT(int n){long[][] tri = new long[n][];for(int i=0; i<n; i++){tri[i] = new long[i+1];for(int j=0; j<i+1; j++){if(j == 0 || j == i){tri[i][j] = 1;}else{tri[i][j] = tri[i-1][j-1] + tri[i-1][j];}}}return tri;}// 最大公約数static int gcd(int a, int b){return b == 0 ? a : gcd(b, a % b);}// 最小公倍数static int lcm(int a, int b){return a * b / gcd(a, b);}}class ContestScanner{private BufferedReader reader;private String[] line;private int idx;public ContestScanner() throws FileNotFoundException{reader = new BufferedReader(new InputStreamReader(System.in));}public ContestScanner(String filename) throws FileNotFoundException{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}public String nextToken() throws IOException{if(line == null || line.length <= idx){line = reader.readLine().trim().split(" ");idx = 0;}return line[idx++];}public long nextLong() throws IOException, NumberFormatException{return Long.parseLong(nextToken());}public int nextInt() throws NumberFormatException, IOException{return (int)nextLong();}public double nextDouble() throws NumberFormatException, IOException{return Double.parseDouble(nextToken());}}