Submission #842346

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
842346	2023-09-02 18:55:22	allin27x	Soccer Stadium (IOI23_soccer)	C++17	35.50 / 100	303 ms	83276 KiB

soccer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int prx[2001][2001];
int pry[2001][2001];
int TestCase1(int n, vector<vector<int>> a){
  for (int i=0; i<n; i++){
    for (int j=0; j<n; j++){
      if (!a[i][j]) continue;
      int h = min(i+1, n-i);
      int v = min(j+1, n-j);
      return n*n-h*v;
    }
  }
  return n*n;
}
int TestCase2(int n, vector<vector<int>> a1){ 
  int ans = 1;
  auto a = a1;
  for (int cd = 0; cd<(1<<(n*n)); cd++){
    a = a1;
    int bad = 0;
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) 
      if (a[i][j] && !(cd&(1<<(n*i+j)))) bad = 1;
    if (bad) continue;
    for (int i=0; i<n; i++) for (int j=0; j<n; j++) a[i][j] = (bool) (cd & (1<<(n*i+j)));
    for (int x1 = 0; x1<n; x1++) for (int y1 = 0; y1<n; y1++){
      if (a[x1][y1]) continue;
      for (int x2 = 0; x2<n; x2++) for (int y2 = 0; y2<n; y2++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 0: 0 / 0
• Subtask 1: 6 / 6
• Subtask 2: 8 / 8
• Subtask 3: 5.5 / 22
• Subtask 4: 4.5 / 18
• Subtask 5: 4 / 16
• Subtask 6: 7.5 / 30