답안 #917916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917916	2024-01-29T05:21:26 Z	Cutebol	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	35644 KB

#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(){YES(1);}
void NO(){YES(0);}
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 all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'

const int N = 2e6 + 5 ;
const int inf = 1e12 ;
const int mod = 1e9 + 8 ;
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 , ans ;
pii a[N] ;
pair <int , pii>  b[N] ;
multiset <int> st ;

void solve(){
	
	cin >> n ;
	for ( int i = 0 ; i < n ; i ++ ) cin >> a[i].ff >> a[i].ss ;
	for ( int i = 0 ; i < n ; i ++ ) b[i] = {a[i].ss-a[i].ff,a[i]} ;
	sort ( b , b + n ) ; sort ( a , a + n ) ;
	for ( int i = 0 ; i < n ; i ++ ){
		int sum = 0 , mn = a[i].ff , mx = a[i].ff ;
		for ( int j = i ; j < n ; j ++ ){
			sum += a[j].ss ;
			chmax ( mx , a[j].ff ) ;
			chmin ( mn , a[j].ff ) ;
			chmax ( ans , sum-mx+mn ) ;
		}
	} cout << ans ;
	
}

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

Compilation message

art.cpp: In function 'void fopn(std::string)':
art.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);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.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
10.0 / 10.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	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2640 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2508 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct

Subtask #2
20.0 / 20.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	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2640 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2508 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2516 KB	Output is correct
18	Correct	1 ms	2648 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2648 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2524 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct

Subtask #3
20.0 / 20.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	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2640 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2508 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2516 KB	Output is correct
18	Correct	1 ms	2648 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2648 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2524 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	18 ms	2652 KB	Output is correct
28	Correct	18 ms	2652 KB	Output is correct
29	Correct	21 ms	2652 KB	Output is correct
30	Correct	21 ms	2760 KB	Output is correct
31	Correct	18 ms	2652 KB	Output is correct
32	Correct	19 ms	2652 KB	Output is correct
33	Correct	17 ms	2652 KB	Output is correct
34	Correct	18 ms	2760 KB	Output is correct
35	Correct	17 ms	2652 KB	Output is correct
36	Correct	17 ms	2772 KB	Output is correct
37	Correct	21 ms	2904 KB	Output is correct
38	Correct	17 ms	2652 KB	Output is correct
39	Correct	19 ms	2760 KB	Output is correct
40	Correct	22 ms	2652 KB	Output is correct
41	Correct	18 ms	2652 KB	Output is correct
42	Correct	17 ms	2764 KB	Output is correct
43	Correct	17 ms	2652 KB	Output is correct
44	Correct	23 ms	2908 KB	Output is correct
45	Correct	17 ms	2652 KB	Output is correct
46	Correct	18 ms	2652 KB	Output is correct
47	Correct	17 ms	2764 KB	Output is correct
48	Correct	18 ms	2652 KB	Output is correct
49	Correct	22 ms	2652 KB	Output is correct
50	Correct	18 ms	2652 KB	Output is correct
51	Correct	18 ms	2652 KB	Output is correct

Subtask #4
0 / 50.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	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2640 KB	Output is correct
7	Correct	1 ms	2392 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2508 KB	Output is correct
10	Correct	1 ms	2516 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2516 KB	Output is correct
18	Correct	1 ms	2648 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2648 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2524 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2392 KB	Output is correct
27	Correct	18 ms	2652 KB	Output is correct
28	Correct	18 ms	2652 KB	Output is correct
29	Correct	21 ms	2652 KB	Output is correct
30	Correct	21 ms	2760 KB	Output is correct
31	Correct	18 ms	2652 KB	Output is correct
32	Correct	19 ms	2652 KB	Output is correct
33	Correct	17 ms	2652 KB	Output is correct
34	Correct	18 ms	2760 KB	Output is correct
35	Correct	17 ms	2652 KB	Output is correct
36	Correct	17 ms	2772 KB	Output is correct
37	Correct	21 ms	2904 KB	Output is correct
38	Correct	17 ms	2652 KB	Output is correct
39	Correct	19 ms	2760 KB	Output is correct
40	Correct	22 ms	2652 KB	Output is correct
41	Correct	18 ms	2652 KB	Output is correct
42	Correct	17 ms	2764 KB	Output is correct
43	Correct	17 ms	2652 KB	Output is correct
44	Correct	23 ms	2908 KB	Output is correct
45	Correct	17 ms	2652 KB	Output is correct
46	Correct	18 ms	2652 KB	Output is correct
47	Correct	17 ms	2764 KB	Output is correct
48	Correct	18 ms	2652 KB	Output is correct
49	Correct	22 ms	2652 KB	Output is correct
50	Correct	18 ms	2652 KB	Output is correct
51	Correct	18 ms	2652 KB	Output is correct
52	Execution timed out	1038 ms	35644 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #917916

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0