oj.uz

답안 #1028268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028268 2024-07-19T15:42:30 Z vjudge1 Sure Bet (CEOI17_sure) C++17
60 / 100
 2000 ms 4720 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
void test_case(){
    int n;
    cin >> n;
    lld a[n]{}, b[n]{};
    fo(i,n)cin >> a[i] >> b[i];
    sort(a,a+n);
    sort(b,b+n);
    lld ans = 0;
    lld sa=0;
    for(int i = 0; i <= n; i++){
        if(i)sa += a[n-i];
        lld sb=0;
        for(int j = 0; j <= n; j++){
            if(j)sb += b[n-j];
            ans = max(ans, min(sa,sb) - i - j);
        }
    }
    cout << ans << endl;
}
int main(){cin.tie(0)->sync_with_stdio(0);
    cout<<setprecision(4)<<fixed;
    int t=1;
    // cin >> t;
    while(t--)test_case();
}

Compilation message

sure.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
sure.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 412 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 35 ms 512 KB Output is correct
13 Correct 36 ms 348 KB Output is correct
14 Correct 35 ms 344 KB Output is correct
15 Correct 35 ms 348 KB Output is correct
16 Correct 35 ms 344 KB Output is correct

Subtask #3
0 / 40.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 412 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 35 ms 512 KB Output is correct
13 Correct 36 ms 348 KB Output is correct
14 Correct 35 ms 344 KB Output is correct
15 Correct 35 ms 348 KB Output is correct
16 Correct 35 ms 344 KB Output is correct
17 Execution timed out 2037 ms 4720 KB Time limit exceeded
18 Halted 0 ms 0 KB -