답안 #1049738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049738	2024-08-09T04:34:52 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	50 / 100	65 ms	20820 KB

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
using namespace std;
// using namespace __gnu_pbds;
// typedef tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define static_assert(...);
#include <tr2/dynamic_bitset>
using custom_bitset = tr2::dynamic_bitset<__uint128_t>;
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define bigInt __int128
#define dl double long
#define fl float
#define all(s) s.begin(), s.end()
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pob_front
#define ins insert
#define F first
#define S second
#define len length
const int N = 100010;
const int M = 1010;
const int LN = 131072;
const int INF = 1000000000000000000;
const int MOD = 1e9 + 7;
const int BLOCK = 500;
int binpow(int a, int b, int MOD) {
    int res = 1;
    while (b > 0) {
        if (b & 1) {
            res = res * a;
            res %= MOD;
        }
        a = a * a;
        a %= MOD;
        b >>= 1;
    }
    return res;
}
int MMI(int a, int MOD) {
    int ret = binpow(a, MOD - 2, MOD);
    return ret;
}
// int mdiv(int a, int b) {
//     int ret = a*MMI(b);
//     ret %= MOD;
//     return ret;
// }
int mmul(int a, int b) {
    int ret = (a % MOD) * (b % MOD);
    ret %= MOD;
    return ret;
}
int madd(int a, int b) {
    int ret = (a % MOD) + (b % MOD);
    ret %= MOD;
    return ret;
}
int msub(int a, int b) {
    int ret = (a % MOD) - (b % MOD);
    ret += MOD;
    ret %= MOD;
    return ret;
}
int GCD(int a, int b) {
    if (b == 0) {
        return a;
    }
    return GCD(b, a % b);
}
int LCM(int a, int b) {
    return a*b / GCD(a, b);
}
struct pqComp
{
    bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const
    {
        return (p1.F < p2.F) || (p1.F == p2.F && p1.S < p2.S);
    }
};
bool pCompF(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.F < p2.F;
}
bool pCompS(pair<int, int>& p1, pair<int, int>& p2)
{
    return p1.S < p2.S;
}
bool pCompFS(pair<int, int>& p1, pair<int, int>& p2)
{
    return (p1.S < p2.S) || (p1.S == p2.S && p1.F < p2.F);
}
vector <pair<int, int>> DS {{1, 0}, {0, 1}};//{{0, -1}, {1, 0}, {0, 1}, {-1, 0}};//, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
int n;
pair<int,int> a[5*N];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].F >> a[i].S;
    }
    if (n <= 5000) {
        sort(a + 1, a + n + 1);
        vector<int> p(n + 1);
        for (int i = 1; i <= n; ++i) {
            p[i] = p[i - 1] + a[i].S;
        }
        int ans = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = i; j <= n; ++j) {
                ans = max(ans, p[j] - p[i - 1] - (a[j].F - a[i].F));
            }
        }
        cout << ans;
        return;
    }
}
 
signed main() {
    speed;
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
}
/*
НЕ ЗАХОДИТ РЕШЕНИЕ?
1) ПРОВЕРЬ НА ОЧЕВИДНЫЕ ОШИБКИ В КОДЕ
2) ПРОВЕРЬ НА ПЕРЕПОЛНЕНИЯ
3) УБЕДИСЬ В ПРАВИЛЬНОСТИ АЛГОРИТМА
*/

Subtask #1
10.0 / 10.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	472 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	400 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	472 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	400 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	6 ms	604 KB	Output is correct
28	Correct	6 ms	708 KB	Output is correct
29	Correct	6 ms	708 KB	Output is correct
30	Correct	6 ms	604 KB	Output is correct
31	Correct	6 ms	716 KB	Output is correct
32	Correct	6 ms	604 KB	Output is correct
33	Correct	6 ms	604 KB	Output is correct
34	Correct	7 ms	604 KB	Output is correct
35	Correct	7 ms	604 KB	Output is correct
36	Correct	6 ms	604 KB	Output is correct
37	Correct	6 ms	712 KB	Output is correct
38	Correct	6 ms	600 KB	Output is correct
39	Correct	6 ms	708 KB	Output is correct
40	Correct	6 ms	604 KB	Output is correct
41	Correct	6 ms	604 KB	Output is correct
42	Correct	6 ms	708 KB	Output is correct
43	Correct	6 ms	712 KB	Output is correct
44	Correct	5 ms	588 KB	Output is correct
45	Correct	6 ms	604 KB	Output is correct
46	Correct	6 ms	604 KB	Output is correct
47	Correct	6 ms	712 KB	Output is correct
48	Correct	6 ms	604 KB	Output is correct
49	Correct	6 ms	604 KB	Output is correct
50	Correct	6 ms	676 KB	Output is correct
51	Correct	6 ms	604 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	472 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	400 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	6 ms	604 KB	Output is correct
28	Correct	6 ms	708 KB	Output is correct
29	Correct	6 ms	708 KB	Output is correct
30	Correct	6 ms	604 KB	Output is correct
31	Correct	6 ms	716 KB	Output is correct
32	Correct	6 ms	604 KB	Output is correct
33	Correct	6 ms	604 KB	Output is correct
34	Correct	7 ms	604 KB	Output is correct
35	Correct	7 ms	604 KB	Output is correct
36	Correct	6 ms	604 KB	Output is correct
37	Correct	6 ms	712 KB	Output is correct
38	Correct	6 ms	600 KB	Output is correct
39	Correct	6 ms	708 KB	Output is correct
40	Correct	6 ms	604 KB	Output is correct
41	Correct	6 ms	604 KB	Output is correct
42	Correct	6 ms	708 KB	Output is correct
43	Correct	6 ms	712 KB	Output is correct
44	Correct	5 ms	588 KB	Output is correct
45	Correct	6 ms	604 KB	Output is correct
46	Correct	6 ms	604 KB	Output is correct
47	Correct	6 ms	712 KB	Output is correct
48	Correct	6 ms	604 KB	Output is correct
49	Correct	6 ms	604 KB	Output is correct
50	Correct	6 ms	676 KB	Output is correct
51	Correct	6 ms	604 KB	Output is correct
52	Incorrect	65 ms	20820 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

답안 #1049738

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