제출 #553503

#제출 시각아이디문제언어결과실행 시간메모리
553503MohamedFaresNebiliSails (IOI07_sails)C++14
0 / 100
1089 ms6560 KiB
#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

        using namespace std;

        using ll = long long;
        using ii = pair<ll, ll>;
        using vi = vector<int>;

        #define ff first
        #define ss second
        #define pb push_back
        #define all(x) (x).begin(), (x).end()
        #define lb lower_bound
        #define int ll

        const int oo = 1e9 + 7;

        int N, arr[100001][2], st[100001];

		int32_t main() {
            ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
            cin >> N; int res = 0;
            for(int l = 0; l < N; l++)
                cin >> arr[l][0] >> arr[l][1];
            for(int l = N - 1; l >= 0; l--) {
                vector<ii> vec;
                for(int i = 0; i < arr[l][0]; i++)
                    vec.pb({st[i], i});
                sort(vec.begin(), vec.end());
                for(int i = 0; i < arr[l][1]; i++)
                    res += st[vec[i].ss], st[vec[i].ss]++;
            }
            cout << res << "\n";
		}



#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...