답안 #632195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
632195	2022-08-19T15:58:09 Z	xynex	Art Exhibition (JOI18_art)	C++17	100 / 100	208 ms	29256 KB

/**
  * Author: Tenjin
  * Created: 19.08.2022 01:29
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/


void solve() {
  int n; read(n);
  vt<pr<ll, ll>> b(n);
  for(auto &x: b) read(x.ff, x.ss);
  sort(all(b));
  vt<pr<ll, ll>> a;
  for(auto x : b) {
    if(!a.empty() && a.back().ff == x.ff) {
      a.back().ss += x.ss;
    }
    else a.push_back(x);
  }
  n = sz(a);
  ll mn = 0, ans = 0, cnt = 0;
  for(int i = 0; i < n; ++i) {
    mn = min(mn, cnt - a[i].ff);
    cnt += a[i].ss;
    ans = max(ans, cnt - a[i].ff - mn);
  }
  print(ans);
}

int main() {
  //freop("");
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
 // read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}

Compilation message

art.cpp: In function 'void freop(std::string)':
art.cpp:72:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:73:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	316 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct

Subtask #2
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	316 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	320 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	316 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	320 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	716 KB	Output is correct
28	Correct	2 ms	720 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	724 KB	Output is correct
31	Correct	2 ms	644 KB	Output is correct
32	Correct	2 ms	724 KB	Output is correct
33	Correct	2 ms	712 KB	Output is correct
34	Correct	3 ms	764 KB	Output is correct
35	Correct	3 ms	636 KB	Output is correct
36	Correct	2 ms	724 KB	Output is correct
37	Correct	2 ms	724 KB	Output is correct
38	Correct	3 ms	656 KB	Output is correct
39	Correct	3 ms	656 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	724 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	2 ms	652 KB	Output is correct
44	Correct	3 ms	724 KB	Output is correct
45	Correct	2 ms	720 KB	Output is correct
46	Correct	2 ms	712 KB	Output is correct
47	Correct	3 ms	724 KB	Output is correct
48	Correct	2 ms	724 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	724 KB	Output is correct
51	Correct	3 ms	724 KB	Output is correct

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	1 ms	316 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	320 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	324 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	320 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	2 ms	716 KB	Output is correct
28	Correct	2 ms	720 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	724 KB	Output is correct
31	Correct	2 ms	644 KB	Output is correct
32	Correct	2 ms	724 KB	Output is correct
33	Correct	2 ms	712 KB	Output is correct
34	Correct	3 ms	764 KB	Output is correct
35	Correct	3 ms	636 KB	Output is correct
36	Correct	2 ms	724 KB	Output is correct
37	Correct	2 ms	724 KB	Output is correct
38	Correct	3 ms	656 KB	Output is correct
39	Correct	3 ms	656 KB	Output is correct
40	Correct	2 ms	640 KB	Output is correct
41	Correct	3 ms	724 KB	Output is correct
42	Correct	2 ms	724 KB	Output is correct
43	Correct	2 ms	652 KB	Output is correct
44	Correct	3 ms	724 KB	Output is correct
45	Correct	2 ms	720 KB	Output is correct
46	Correct	2 ms	712 KB	Output is correct
47	Correct	3 ms	724 KB	Output is correct
48	Correct	2 ms	724 KB	Output is correct
49	Correct	2 ms	640 KB	Output is correct
50	Correct	2 ms	724 KB	Output is correct
51	Correct	3 ms	724 KB	Output is correct
52	Correct	184 ms	17120 KB	Output is correct
53	Correct	186 ms	29120 KB	Output is correct
54	Correct	181 ms	29128 KB	Output is correct
55	Correct	187 ms	29236 KB	Output is correct
56	Correct	176 ms	29120 KB	Output is correct
57	Correct	176 ms	29176 KB	Output is correct
58	Correct	200 ms	29116 KB	Output is correct
59	Correct	176 ms	29112 KB	Output is correct
60	Correct	176 ms	29108 KB	Output is correct
61	Correct	203 ms	29140 KB	Output is correct
62	Correct	180 ms	29248 KB	Output is correct
63	Correct	182 ms	29244 KB	Output is correct
64	Correct	179 ms	29256 KB	Output is correct
65	Correct	179 ms	29120 KB	Output is correct
66	Correct	181 ms	29120 KB	Output is correct
67	Correct	208 ms	29244 KB	Output is correct
68	Correct	175 ms	29116 KB	Output is correct

답안 #632195

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0