답안 #889720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
889720	2023-12-20T06:08:45 Z	vjudge1	Council (JOI23_council)	C++17	41 / 100	4000 ms	86984 KB

council

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){cout << "Yes\n" ;}
void NO(){cout << "No\n" ;}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define ff first
#define ss second
#define endl '\n'

const int N = 3e5 + 5 ;
const int inf = 1e18 ;
const int mod = 998244353 ;
const double eps = 1e-8 ;

int binpow( int a , int b ){
  if ( b == 0 ) return 1 ;
  int x = binpow ( a , b/2 ) ;
  if ( !(b%2) ) return (x*x) ;
  return (x*x*a) ;
}
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}

//code

int n , m ;
int a[N][30] , cnt[30] , b[N] , ans[N] , c[N] ;
vector <int> g[N] ;


void solve(){
	
	cin >> n >> m ;
	for ( int i = 0 ; i < n ; i ++ ){
		for ( int j = 0 ; j < m ; j ++ ) cin >> a[i][j] ;
	}
	if ( m <= 10 ){
		for ( int i = 0 ; i < n ; i ++ ){
			for ( int j = 0 ; j < m ; j ++ ){
				cnt[j] += a[i][j] ;
				if (a[i][j]) b[i] += (1<<j) ;
			} c[b[i]] ++ ;
			g[b[i]].push_back(i) ;
		}
		for ( int i = 0 ; i < ( 1 << m ) ; i ++ ){
			if (!c[i]) continue ;
			c[i] -- ;
			for ( int l = 0 ; l < m ; l ++ ) if ( i & ( 1 << l ) ) cnt[l] -- ;
			for ( int j = 0 ; j < ( 1 << m ) ; j ++ ){
				int res = 0 ;
				if (!c[j]) continue ;
				c[j] -- ;
				for ( int l = 0 ; l < m ; l ++ ) if ( j & ( 1 << l ) ) cnt[l] -- ;
				for ( int l = 0 ; l < m ; l ++ ) if( cnt[l] >= n/2 ) res ++ ;
				chmax ( ans[i] , res ) ; chmax ( ans[j] , res ) ;
				for ( int l = 0 ; l < m ; l ++ ) if ( j & ( 1 << l ) ) cnt[l] ++ ;
				c[j] ++ ;
			}
			c[i] ++ ;
			for ( int l = 0 ; l < m ; l ++ ) if ( i & ( 1 << l ) ) cnt[l] ++ ;
		}
		for ( int i = 0 ; i < n ; i ++ ) cout << ans[b[i]] << endl ;
		return ;
	}
	for ( int i = 0 ; i < n ; i ++ ){
		int ans = 0 ;
		for ( int j = 0 ; j < m ; j ++ ) cnt[j] = 0 ;
		for ( int j = 0 ; j < m ; j ++ ){
			for ( int l = 0 ; l < n ; l ++ ){
				if ( l == i ) continue ;
				cnt[j] += a[l][j] ;
			}
		}
		for ( int j = 0 ; j < n ; j ++ ){
			if ( i == j ) continue ;
			int cur = 0 ;
			for ( int l = 0 ; l < m ; l ++ ){
				cur += ((cnt[l]-a[j][l])>=(n)/2) ;
			}
			chmax ( ans , cur ) ;
		} cout << ans << endl ;
	}	
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message

council.cpp: In function 'void fopn(std::string)':
council.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(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	2 ms	10840 KB	Output is correct
2	Correct	2 ms	10844 KB	Output is correct
3	Correct	2 ms	10844 KB	Output is correct
4	Correct	2 ms	10844 KB	Output is correct
5	Correct	2 ms	10844 KB	Output is correct
6	Correct	5 ms	10840 KB	Output is correct
7	Correct	3 ms	10844 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	5 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	5 ms	10900 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10840 KB	Output is correct
16	Correct	2 ms	10916 KB	Output is correct
17	Correct	2 ms	10844 KB	Output is correct
18	Correct	3 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	2 ms	10844 KB	Output is correct
21	Correct	2 ms	10844 KB	Output is correct
22	Correct	2 ms	10844 KB	Output is correct
23	Correct	2 ms	10844 KB	Output is correct
24	Correct	2 ms	10844 KB	Output is correct
25	Correct	2 ms	10844 KB	Output is correct
26	Correct	2 ms	10844 KB	Output is correct
27	Correct	2 ms	10884 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	5 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	10844 KB	Output is correct
36	Correct	2 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	5 ms	10936 KB	Output is correct
41	Correct	2 ms	10844 KB	Output is correct
42	Correct	2 ms	10844 KB	Output is correct
43	Correct	2 ms	10844 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	2 ms	10844 KB	Output is correct
46	Correct	2 ms	10860 KB	Output is correct
47	Correct	2 ms	10844 KB	Output is correct
48	Correct	2 ms	10844 KB	Output is correct
49	Correct	2 ms	10844 KB	Output is correct
50	Correct	2 ms	10844 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10840 KB	Output is correct
2	Correct	2 ms	10844 KB	Output is correct
3	Correct	2 ms	10844 KB	Output is correct
4	Correct	2 ms	10844 KB	Output is correct
5	Correct	2 ms	10844 KB	Output is correct
6	Correct	5 ms	10840 KB	Output is correct
7	Correct	3 ms	10844 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	5 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	5 ms	10900 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10840 KB	Output is correct
16	Correct	2 ms	10916 KB	Output is correct
17	Correct	2 ms	10844 KB	Output is correct
18	Correct	3 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	2 ms	10844 KB	Output is correct
21	Correct	2 ms	10844 KB	Output is correct
22	Correct	2 ms	10844 KB	Output is correct
23	Correct	2 ms	10844 KB	Output is correct
24	Correct	2 ms	10844 KB	Output is correct
25	Correct	2 ms	10844 KB	Output is correct
26	Correct	2 ms	10844 KB	Output is correct
27	Correct	2 ms	10884 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	5 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	10844 KB	Output is correct
36	Correct	2 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	5 ms	10936 KB	Output is correct
41	Correct	2 ms	10844 KB	Output is correct
42	Correct	2 ms	10844 KB	Output is correct
43	Correct	2 ms	10844 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	2 ms	10844 KB	Output is correct
46	Correct	2 ms	10860 KB	Output is correct
47	Correct	2 ms	10844 KB	Output is correct
48	Correct	2 ms	10844 KB	Output is correct
49	Correct	2 ms	10844 KB	Output is correct
50	Correct	2 ms	10844 KB	Output is correct
51	Correct	466 ms	12888 KB	Output is correct
52	Correct	288 ms	12936 KB	Output is correct
53	Correct	351 ms	12928 KB	Output is correct
54	Correct	330 ms	12940 KB	Output is correct
55	Correct	3 ms	12892 KB	Output is correct
56	Correct	277 ms	13184 KB	Output is correct

Subtask #3
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10844 KB	Output is correct
2	Correct	60 ms	86764 KB	Output is correct
3	Correct	50 ms	85704 KB	Output is correct
4	Correct	41 ms	84936 KB	Output is correct
5	Correct	54 ms	84672 KB	Output is correct
6	Correct	42 ms	84848 KB	Output is correct
7	Correct	55 ms	84548 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	3 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	2 ms	10896 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10844 KB	Output is correct
16	Correct	2 ms	10884 KB	Output is correct
17	Correct	3 ms	12892 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10844 KB	Output is correct
2	Correct	60 ms	86764 KB	Output is correct
3	Correct	50 ms	85704 KB	Output is correct
4	Correct	41 ms	84936 KB	Output is correct
5	Correct	54 ms	84672 KB	Output is correct
6	Correct	42 ms	84848 KB	Output is correct
7	Correct	55 ms	84548 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	3 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	2 ms	10896 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10844 KB	Output is correct
16	Correct	2 ms	10884 KB	Output is correct
17	Correct	3 ms	12892 KB	Output is correct
18	Correct	2 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	163 ms	86732 KB	Output is correct
21	Correct	147 ms	86440 KB	Output is correct
22	Correct	146 ms	86236 KB	Output is correct
23	Correct	153 ms	86984 KB	Output is correct
24	Correct	126 ms	85448 KB	Output is correct
25	Correct	276 ms	86720 KB	Output is correct
26	Correct	269 ms	86700 KB	Output is correct
27	Correct	2 ms	10844 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	2 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	11096 KB	Output is correct
36	Correct	5 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	3 ms	10844 KB	Output is correct
41	Correct	2 ms	10864 KB	Output is correct
42	Correct	2 ms	10848 KB	Output is correct
43	Correct	2 ms	10912 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	5 ms	10900 KB	Output is correct

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10844 KB	Output is correct
2	Correct	60 ms	86764 KB	Output is correct
3	Correct	50 ms	85704 KB	Output is correct
4	Correct	41 ms	84936 KB	Output is correct
5	Correct	54 ms	84672 KB	Output is correct
6	Correct	42 ms	84848 KB	Output is correct
7	Correct	55 ms	84548 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	3 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	2 ms	10896 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10844 KB	Output is correct
16	Correct	2 ms	10884 KB	Output is correct
17	Correct	3 ms	12892 KB	Output is correct
18	Correct	2 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	163 ms	86732 KB	Output is correct
21	Correct	147 ms	86440 KB	Output is correct
22	Correct	146 ms	86236 KB	Output is correct
23	Correct	153 ms	86984 KB	Output is correct
24	Correct	126 ms	85448 KB	Output is correct
25	Correct	276 ms	86720 KB	Output is correct
26	Correct	269 ms	86700 KB	Output is correct
27	Correct	2 ms	10844 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	2 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	11096 KB	Output is correct
36	Correct	5 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	3 ms	10844 KB	Output is correct
41	Correct	2 ms	10864 KB	Output is correct
42	Correct	2 ms	10848 KB	Output is correct
43	Correct	2 ms	10912 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	5 ms	10900 KB	Output is correct
46	Correct	2 ms	10844 KB	Output is correct
47	Execution timed out	4089 ms	80644 KB	Time limit exceeded
48	Halted	0 ms	0 KB	-

Subtask #6
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10844 KB	Output is correct
2	Correct	60 ms	86764 KB	Output is correct
3	Correct	50 ms	85704 KB	Output is correct
4	Correct	41 ms	84936 KB	Output is correct
5	Correct	54 ms	84672 KB	Output is correct
6	Correct	42 ms	84848 KB	Output is correct
7	Correct	55 ms	84548 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	3 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	2 ms	10896 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10844 KB	Output is correct
16	Correct	2 ms	10884 KB	Output is correct
17	Correct	3 ms	12892 KB	Output is correct
18	Correct	2 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	163 ms	86732 KB	Output is correct
21	Correct	147 ms	86440 KB	Output is correct
22	Correct	146 ms	86236 KB	Output is correct
23	Correct	153 ms	86984 KB	Output is correct
24	Correct	126 ms	85448 KB	Output is correct
25	Correct	276 ms	86720 KB	Output is correct
26	Correct	269 ms	86700 KB	Output is correct
27	Correct	2 ms	10844 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	2 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	11096 KB	Output is correct
36	Correct	5 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	3 ms	10844 KB	Output is correct
41	Correct	2 ms	10864 KB	Output is correct
42	Correct	2 ms	10848 KB	Output is correct
43	Correct	2 ms	10912 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	5 ms	10900 KB	Output is correct
46	Correct	2 ms	10844 KB	Output is correct
47	Execution timed out	4089 ms	80644 KB	Time limit exceeded
48	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	10840 KB	Output is correct
2	Correct	2 ms	10844 KB	Output is correct
3	Correct	2 ms	10844 KB	Output is correct
4	Correct	2 ms	10844 KB	Output is correct
5	Correct	2 ms	10844 KB	Output is correct
6	Correct	5 ms	10840 KB	Output is correct
7	Correct	3 ms	10844 KB	Output is correct
8	Correct	2 ms	10844 KB	Output is correct
9	Correct	5 ms	10844 KB	Output is correct
10	Correct	2 ms	10844 KB	Output is correct
11	Correct	2 ms	10844 KB	Output is correct
12	Correct	5 ms	10900 KB	Output is correct
13	Correct	2 ms	10844 KB	Output is correct
14	Correct	2 ms	10844 KB	Output is correct
15	Correct	2 ms	10840 KB	Output is correct
16	Correct	2 ms	10916 KB	Output is correct
17	Correct	2 ms	10844 KB	Output is correct
18	Correct	3 ms	10844 KB	Output is correct
19	Correct	2 ms	10844 KB	Output is correct
20	Correct	2 ms	10844 KB	Output is correct
21	Correct	2 ms	10844 KB	Output is correct
22	Correct	2 ms	10844 KB	Output is correct
23	Correct	2 ms	10844 KB	Output is correct
24	Correct	2 ms	10844 KB	Output is correct
25	Correct	2 ms	10844 KB	Output is correct
26	Correct	2 ms	10844 KB	Output is correct
27	Correct	2 ms	10884 KB	Output is correct
28	Correct	2 ms	10844 KB	Output is correct
29	Correct	2 ms	10844 KB	Output is correct
30	Correct	2 ms	10844 KB	Output is correct
31	Correct	5 ms	10844 KB	Output is correct
32	Correct	2 ms	10844 KB	Output is correct
33	Correct	2 ms	10844 KB	Output is correct
34	Correct	2 ms	10844 KB	Output is correct
35	Correct	2 ms	10844 KB	Output is correct
36	Correct	2 ms	10844 KB	Output is correct
37	Correct	2 ms	10844 KB	Output is correct
38	Correct	2 ms	10844 KB	Output is correct
39	Correct	2 ms	10844 KB	Output is correct
40	Correct	5 ms	10936 KB	Output is correct
41	Correct	2 ms	10844 KB	Output is correct
42	Correct	2 ms	10844 KB	Output is correct
43	Correct	2 ms	10844 KB	Output is correct
44	Correct	2 ms	10844 KB	Output is correct
45	Correct	2 ms	10844 KB	Output is correct
46	Correct	2 ms	10860 KB	Output is correct
47	Correct	2 ms	10844 KB	Output is correct
48	Correct	2 ms	10844 KB	Output is correct
49	Correct	2 ms	10844 KB	Output is correct
50	Correct	2 ms	10844 KB	Output is correct
51	Correct	466 ms	12888 KB	Output is correct
52	Correct	288 ms	12936 KB	Output is correct
53	Correct	351 ms	12928 KB	Output is correct
54	Correct	330 ms	12940 KB	Output is correct
55	Correct	3 ms	12892 KB	Output is correct
56	Correct	277 ms	13184 KB	Output is correct
57	Correct	2 ms	10844 KB	Output is correct
58	Correct	60 ms	86764 KB	Output is correct
59	Correct	50 ms	85704 KB	Output is correct
60	Correct	41 ms	84936 KB	Output is correct
61	Correct	54 ms	84672 KB	Output is correct
62	Correct	42 ms	84848 KB	Output is correct
63	Correct	55 ms	84548 KB	Output is correct
64	Correct	2 ms	10844 KB	Output is correct
65	Correct	3 ms	10844 KB	Output is correct
66	Correct	2 ms	10844 KB	Output is correct
67	Correct	2 ms	10844 KB	Output is correct
68	Correct	2 ms	10896 KB	Output is correct
69	Correct	2 ms	10844 KB	Output is correct
70	Correct	2 ms	10844 KB	Output is correct
71	Correct	2 ms	10844 KB	Output is correct
72	Correct	2 ms	10884 KB	Output is correct
73	Correct	3 ms	12892 KB	Output is correct
74	Correct	2 ms	10844 KB	Output is correct
75	Correct	2 ms	10844 KB	Output is correct
76	Correct	163 ms	86732 KB	Output is correct
77	Correct	147 ms	86440 KB	Output is correct
78	Correct	146 ms	86236 KB	Output is correct
79	Correct	153 ms	86984 KB	Output is correct
80	Correct	126 ms	85448 KB	Output is correct
81	Correct	276 ms	86720 KB	Output is correct
82	Correct	269 ms	86700 KB	Output is correct
83	Correct	2 ms	10844 KB	Output is correct
84	Correct	2 ms	10844 KB	Output is correct
85	Correct	2 ms	10844 KB	Output is correct
86	Correct	2 ms	10844 KB	Output is correct
87	Correct	2 ms	10844 KB	Output is correct
88	Correct	2 ms	10844 KB	Output is correct
89	Correct	2 ms	10844 KB	Output is correct
90	Correct	2 ms	10844 KB	Output is correct
91	Correct	2 ms	11096 KB	Output is correct
92	Correct	5 ms	10844 KB	Output is correct
93	Correct	2 ms	10844 KB	Output is correct
94	Correct	2 ms	10844 KB	Output is correct
95	Correct	2 ms	10844 KB	Output is correct
96	Correct	3 ms	10844 KB	Output is correct
97	Correct	2 ms	10864 KB	Output is correct
98	Correct	2 ms	10848 KB	Output is correct
99	Correct	2 ms	10912 KB	Output is correct
100	Correct	2 ms	10844 KB	Output is correct
101	Correct	5 ms	10900 KB	Output is correct
102	Correct	2 ms	10844 KB	Output is correct
103	Execution timed out	4089 ms	80644 KB	Time limit exceeded
104	Halted	0 ms	0 KB	-

답안 #889720

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 6.0 / 6.0

Subtask #4 19.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
6.0 / 6.0

Subtask #4
19.0 / 19.0

Subtask #5
0 / 15.0

Subtask #6
0 / 22.0

Subtask #7
0 / 22.0