oj.uz

Submission #554917

# Submission time Handle Problem Language Result Execution time Memory
554917 2022-04-29T15:27:46 Z MohamedFaresNebili Sails (IOI07_sails) C++14
30 / 100
 1000 ms 4556 KB 
#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;

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 1 ms 1108 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1088 KB Output is correct
2 Correct 8 ms 1108 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 1208 KB Output is correct
2 Execution timed out 1088 ms 2848 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 1624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 2196 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 2636 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 4556 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 3936 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 4104 KB Time limit exceeded
2 Halted 0 ms 0 KB -