# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446056 | 233 | Robot (JOI21_ho_t4) | Java | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import java.util.*;
import java.io.*;
import java.awt.Point;
import static java.lang.Math.*;
public class Solution {
public static LinkedList<Integer>[] edges;
public static int n, m;
public static void main(String[] args) throws IOException{
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(input.readLine());
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
edges = new LinkedList[n];
for(int i = 0;i<n;i++) {
edges[i] = new LinkedList<Integer>();
}
for(int i = 0;i<m;i++) {
st = new StringTokenizer(input.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
int c = Integer.parseInt(st.nextToken());
int p = Integer.parseInt(st.nextToken());
edges[a].add(b);
pair pair = new pair(p, c);
}
System.out.println(3);
}
static class pair{
int c, p;
public pair(int c, int p) {
this.c = c;
this.p = p;
}
}
}