답안 #889599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889599	2023-12-20T03:42:10 Z	vjudge1	Council (JOI23_council)	C++17	16 / 100	4000 ms	62036 KB

council

#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
const int N = 3e5 + 5, inf = 1e18;

int a[N][25];
int cnt[25];
int ans[N];

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			cnt[j] += (a[i][j] == 1);
		}
	}
	
	for(int i = 1 ; i <= n; i++){
		for(int j = i + 1; j <= n; j++){
			int res = 0 ;
			for(int l = 1; l <= m; l++){
				cnt[l] -= (a[i][l] == 1) + (a[j][l] == 1);
				res += (cnt[l] >= n / 2);
			}
			ans[i] = max(ans[i], res);
			ans[j] = max(ans[j], res);
			for(int l = 1; l <= m; l++){
				cnt[l] += (a[i][l] == 1) + (a[j][l] == 1);
				//res += (cnt[j] >= n / 2);
			}
		}
	}
	for(int i = 1; i <= n; i++)
		cout << ans[i] <<"\n";
}

/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

Compilation message

council.cpp:24:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   24 | main(){
      | ^~~~
council.cpp: In function 'void fp(std::string)':
council.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2512 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	3 ms	2396 KB	Output is correct
7	Correct	1 ms	2512 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	3 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	3 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	0 ms	2516 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2516 KB	Output is correct
38	Correct	1 ms	2400 KB	Output is correct
39	Correct	1 ms	2400 KB	Output is correct
40	Correct	2 ms	2404 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2400 KB	Output is correct
43	Correct	1 ms	2400 KB	Output is correct
44	Correct	1 ms	2400 KB	Output is correct
45	Correct	1 ms	2512 KB	Output is correct
46	Correct	1 ms	2528 KB	Output is correct
47	Correct	1 ms	2408 KB	Output is correct
48	Correct	1 ms	2408 KB	Output is correct
49	Correct	1 ms	2408 KB	Output is correct
50	Correct	1 ms	2408 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2512 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	3 ms	2396 KB	Output is correct
7	Correct	1 ms	2512 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	3 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	3 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	0 ms	2516 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2516 KB	Output is correct
38	Correct	1 ms	2400 KB	Output is correct
39	Correct	1 ms	2400 KB	Output is correct
40	Correct	2 ms	2404 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2400 KB	Output is correct
43	Correct	1 ms	2400 KB	Output is correct
44	Correct	1 ms	2400 KB	Output is correct
45	Correct	1 ms	2512 KB	Output is correct
46	Correct	1 ms	2528 KB	Output is correct
47	Correct	1 ms	2408 KB	Output is correct
48	Correct	1 ms	2408 KB	Output is correct
49	Correct	1 ms	2408 KB	Output is correct
50	Correct	1 ms	2408 KB	Output is correct
51	Correct	239 ms	2660 KB	Output is correct
52	Correct	223 ms	2652 KB	Output is correct
53	Correct	225 ms	2648 KB	Output is correct
54	Correct	229 ms	2648 KB	Output is correct
55	Correct	30 ms	2396 KB	Output is correct
56	Correct	193 ms	2392 KB	Output is correct

Subtask #3
0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4017 ms	62036 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4017 ms	62036 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4017 ms	62036 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #6
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4017 ms	62036 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2512 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	3 ms	2396 KB	Output is correct
7	Correct	1 ms	2512 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	3 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	3 ms	2396 KB	Output is correct
13	Correct	0 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	0 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	0 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	0 ms	2516 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2516 KB	Output is correct
38	Correct	1 ms	2400 KB	Output is correct
39	Correct	1 ms	2400 KB	Output is correct
40	Correct	2 ms	2404 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2400 KB	Output is correct
43	Correct	1 ms	2400 KB	Output is correct
44	Correct	1 ms	2400 KB	Output is correct
45	Correct	1 ms	2512 KB	Output is correct
46	Correct	1 ms	2528 KB	Output is correct
47	Correct	1 ms	2408 KB	Output is correct
48	Correct	1 ms	2408 KB	Output is correct
49	Correct	1 ms	2408 KB	Output is correct
50	Correct	1 ms	2408 KB	Output is correct
51	Correct	239 ms	2660 KB	Output is correct
52	Correct	223 ms	2652 KB	Output is correct
53	Correct	225 ms	2648 KB	Output is correct
54	Correct	229 ms	2648 KB	Output is correct
55	Correct	30 ms	2396 KB	Output is correct
56	Correct	193 ms	2392 KB	Output is correct
57	Correct	1 ms	2392 KB	Output is correct
58	Execution timed out	4017 ms	62036 KB	Time limit exceeded
59	Halted	0 ms	0 KB	-

답안 #889599

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 6.0

Subtask #4 0 / 19.0

Subtask #5 0 / 15.0

Subtask #6 0 / 22.0

Subtask #7 0 / 22.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 6.0

Subtask #4
0 / 19.0

Subtask #5
0 / 15.0

Subtask #6
0 / 22.0

Subtask #7
0 / 22.0