結果

問題 No.2315 Flying Camera
ユーザー Sagnik GhoshSagnik Ghosh
提出日時 2023-06-07 01:50:51
言語 Java
(openjdk 23)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 7,948 bytes
コンパイル時間 4,474 ms
コンパイル使用メモリ 93,816 KB
実行使用メモリ 42,408 KB
最終ジャッジ日時 2024-12-29 08:55:30
合計ジャッジ時間 10,380 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

// JAI SHREE RAM
/*
░██████╗░█████╗░░██████╗░███╗░░██╗██╗██╗░░██╗░██████╗░██╗░░██╗░█████╗░░██████╗██╗░░██╗░█████╗░██████╗░███████╗
██╔════╝██╔══██╗██╔════╝░████╗░██║██║██║░██╔╝██╔════╝░██║░░██║██╔══██╗██╔════╝██║░░██║██╔══██╗██╔══██╗╚════██║
╚█████╗░███████║██║░░██╗░██╔██╗██║██║█████═╝░██║░░██╗░███████║██║░░██║╚█████╗░███████║██║░░╚═╝██████╔╝░░░░██╔╝
░╚═══██╗██╔══██║██║░░╚██╗██║╚████║██║██╔═██╗░██║░░╚██╗██╔══██║██║░░██║░╚═══██╗██╔══██║██║░░██╗██╔══██╗░░░██╔╝░
██████╔╝██║░░██║╚██████╔╝██║░╚███║██║██║░╚██╗╚██████╔╝██║░░██║╚█████╔╝██████╔╝██║░░██║╚█████╔╝██║░░██║░░██╔╝░░
╚═════╝░╚═╝░░╚═╝░╚═════╝░╚═╝░░╚══╝╚═╝╚═╝░░╚═╝░╚═════╝░╚═╝░░╚═╝░╚════╝░╚═════╝░╚═╝░░╚═╝░╚════╝░╚═╝░░╚═╝░░╚═╝░░░
*/
import java.util.*;
import java.util.Map.Entry;
import java.util.stream.*;
import java.lang.*;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.io.*;
public class No_2315_Flying_Camera {
static Scanner sc = new Scanner(System.in);
static FastScanner fs = new FastScanner();
static PrintWriter out = new PrintWriter(System.out);
static final Random random = new Random();
static final int mod = 1_000_000_007;
static final int MAXN = 1000001;
static StringBuilder sb = new StringBuilder();
static final int dx[] = { -1, 0, 1, 0 }, dy[] = { 0, -1, 0, 1 };
static final int[] dx8 = { -1, -1, -1, 0, 0, 1, 1, 1 }, dy8 = { -1, 0, 1, -1, 1, -1, 0, 1 };
static final int[] dx9 = { -1, -1, -1, 0, 0, 0, 1, 1, 1 }, dy9 = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
static final double eps = 1e-10;
static long [] larr = new long[100001];
static int cnt = 0, tmpSum = 0;
private static void sagnik() throws IOException {
int n = fs.nextInt();
int[] x = new int[n];
int[] y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = fs.nextInt();
y[i] = fs.nextInt();
}
int ans = Integer.MAX_VALUE;
for (int i = 0; i <= 300; i++) {
for (int j = 0; j <= 300; j++) {
int val = 0;
for (int k = 0; k < n; k++) {
val += Math.abs(i - x[k]);
val += Math.abs(j - y[k]);
}
ans = Math.min(ans, val);
}
}
out.println(ans);
out.flush();
}
public static void main(String[] args) throws IOException { int t = 1; while(t-->0) sagnik(); } // Make t = 1 baby
// dont worry bout me, i'm not high
private static int arrMax(int[] A) {return Arrays.stream(A).max().getAsInt();}
private static int arrMin(int[] A) {return Arrays.stream(A).min().getAsInt();}
private static int arrSum(int[] A) {return Arrays.stream(A).sum();}
private static int countNumInArr(int[] A, int n) {return (int) Arrays.stream(A).filter(x -> x == n).count();}
private static void swap(int[] A, int i, int j) { int temp = A[i]; A[i] = A[j]; A[j] = temp; }
private static void reverse(int[] A) {int s=0,e=A.length-1;while(s<e){swap(A,s,e);s++;e--;}}
private static void reverse(int[] A, int s) {int e=A.length-1;while(s<e){swap(A,s,e);s++;e--;}}
private static void reverse(int[] A, int s, int e) {while(s<e){swap(A,s,e);s++;e--;}}
private static int countSetBits(int number){int count=0; while(number>0){++count; number &= number-1;} return count;}
private static boolean isEven(int i) { return (i & 1) == 0; }
private static boolean isVowel(char c) { return c=='a' || c=='A' || c=='e' || c=='E' || c=='i' || c=='I' || c=='o' || c=='O' || c=='u' || c=='U'
        ;}
private static boolean isPrime(int x) {if(x==1) return false; for(int i=2; i*i<=x; i++){if(x%i==0) return false;} return true;}
public static boolean[] genSieve(int n) {boolean[] A = new boolean[n+1]; for(int i=0;i<n;i++) A[i] = true; for(int p=2; p*p <=n; p++) if(A[p])
        for(int i = p*2; i<=n; i+=p) A[i] = false; return A;}
private static int gcd(int a, int b) {if (b == 0) return a; return gcd(b, a % b);}
private static int lcm(int a, int b) {return (a*b)/gcd(a, b);}
private static int[] listToArr(List<Integer> x) {return x.stream().mapToInt(i -> i).toArray();}
private static int[] setArray(int n) {int A[]=new int[n]; for(int i=0;i<n;i++) A[i]=sc.nextInt(); return A;}
private static long[] lsetArray(int n) {long A[]=new long[n]; for(int i=0;i<n;i++) A[i]=sc.nextLong(); return A;}
private static void prtList(List<Integer> x) {for(int i : x) {System.out.print(i+" ");}}
private static void prtArr(int[] A) {System.out.println(Arrays.toString(A));}
private static void prtArrWithSpce(int[] A) {for(int i=0;i<A.length;i++)System.out.print(A[i]+" ");}
private static void prtArrWithSpce(int[] A, int s) {for(int i=s;i<A.length;i++)System.out.print(A[i]+" ");}
private static void prtArrWithSpce(int[] A, int s, int e) {for(int i=s;i<=e;i++)System.out.print(A[i]+" ");}
private static void debug(Object... o) {if(o.length != 0) System.err.println(Arrays.deepToString(o)); else System.err.println();}
// DecimalFormat df = new DecimalFormat("#.###");
// DecimalFormat df = new DecimalFormat(); df.setMaximumFractionDigits(12);
// System.out.println(df.format(input_Decimal_Here));
// fastIO cos why not
public static class FastScanner {
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer st = new StringTokenizer("");
private static String next() throws IOException {while(!st.hasMoreTokens()) try {st=new StringTokenizer(br.readLine());} catch (IOException e
            ) {e.printStackTrace();} return st.nextToken();}
private static int[] setArray(int n) throws IOException {int[] a = new int[n]; for (int i=0; i<n; i++) a[i] = nextInt(); return a;}
private static long[] lsetArray(int n) throws IOException {long a[] = new long[n]; for(int i=0; i<n; i++) a[i] = nextLong(); return a;}
private static int nextInt() throws IOException {return Integer.parseInt(next());}
private static Long nextLong() throws IOException {return Long.parseLong(next());}
private static double nextDouble() throws IOException {return Double.parseDouble(next());}
private static char nextChar() throws IOException {return next().toCharArray()[0];}
private static String nextString() throws IOException {return next();}
private static String nextLine() throws IOException {return br.readLine();}
private static String nextToken() throws IOException {while (st == null || !st.hasMoreElements()) {try {st = new StringTokenizer(br.readLine
            ());} catch (IOException e) {e.printStackTrace();}} return st.nextToken();}
private static BigInteger nextBigInteger() throws IOException {return new BigInteger(next());}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0