# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1121830 | vjudge1 | Ice Hockey World Championship (CEOI15_bobek) | C++11 | 1133 ms | 903532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define itn int
#define Int int
#define INF -1000000
#define MOD 1000000007
#define endl "\n"
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
using namespace std;
int temp;
signed main() {
GOOD_LUCK
int t;
t = 1;
// cin >> t;
while (t--) {
int n, m, s=0, cnt=0, k=0;
cin >> n >> m;
vector <int> v;
for (int i=0; i < n; i++) {
cin >> temp;
if (temp < m) {
v.push_back(temp);
k+=temp;
}
if (temp == m) s++;
}
n = v.size();
vector <vector<int>> dp(n+2, vector<int>(n+2, 0)); // 2D: [i][j] --> j-elementli v[i]-in sonda oldugu subarray-deki elementlerin sayi
vector <vector<vector<int>>> sums(n+1, vector<vector<int>>(n+1)); // 3D: [i][j][] --> dp[i][j]-deki countlarin her birini alanda alinan sumlari saxlayan 1D vector
for (int i=0; i < n; i++) {
dp[i][1] = 1;
sums[i][1] = {v[i]};
}
for (int i=0; i < n; i++) {
for (int x=2; x <= i+1; ++x) {
int x1 = x;
for (int j=1; j < x; j++) {
for (int y : sums[i][j]) {
if (y + v[i] <= m) {
sums[i][x].push_back(y + v[i]);
dp[i][x]++;
}
}
}
x = x1;
}
}
int ans=0;
for (int i=0; i < n; i++) {
for (int j=0; j< n; j++) {
ans += dp[i][j];
for (int z : sums[i][j]) {
cout << z << endl;
}
cout << endl;
}
}
cout << ans;
}
return 0;
}
// Problem B
// by Ekber_Ekber
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |