Submission #1163458

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1163458	2025-03-08 07:17:26	tosivanmak	Towns (IOI15_towns)	C++20	25 / 100	10 ms	584 KiB

towns

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>
#include "towns.h"
using namespace std;
#define ll long long
static int _N;
static int _dist[110][110];
static int _quota, _user_query;
// void _ini_query(int N, int k) {
//     int ret;
//     _N = N;
//     for (int i = 0; i < _N; i++) 
//         for (int j = 0; j < _N; j++)  {
//      ret = scanf("%d", &_dist[i][j]);
//             assert(ret == 1);
//         }
//     if (k == 1 || k == 3) _quota = _N * (_N - 1) / 2;
//     else if (k == 2 || k == 4 || k == 6) _quota = (7 * _N + 1) / 2;
//     else _quota = 5 * _N;
//     _user_query = 0;
// }
// int getDistance(int i, int j) {
//     _user_query++;
//     if (_user_query > _quota) {
//         printf("0\n");
//         exit(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39