year stringdate 2020-01-01 00:00:00 2020-01-01 00:00:00 | problem_id stringclasses 2
values | subtask stringclasses 9
values | label stringclasses 2
values | code stringclasses 2
values |
|---|---|---|---|---|
2020 | tickets | 00-samples | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 01-calc-median | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 02-one-day-sort | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 03-two-locations | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 04-all-sent | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 05-n2k2-knapsack | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 06-n2k-no-pq | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | tickets | 07-full | wy-subtask1.cpp | #include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> values;
long long find_maximum(int k, std::vector<std::vector<int>> d) {
int c = d.size();
int s = d[0].size();
for (int i = 0; i < c; i++) values.push_back(d[i][0]);
sort(values.begin(), values.end());
long long ans = 0;
for (int i... |
2020 | biscuits | 00-samples | biscuits-yanhao-oneX.cpp | #include "biscuits.h"
#include <vector>
using namespace std;
void merge_biscuits(vector<long long> &a) {
while(a.size()<61) a.push_back(0);
for(int i=0; i<(int)a.size(); i++) {
if(a[i]>2) {
a[i+1] += (a[i]-1)/2;
a[i] = (a[i]%2 ? 1 : 2);
}
}
}
long long count_tastine... |
2020 | biscuits | 01-smallTotalSum | biscuits-yanhao-oneX.cpp | #include "biscuits.h"
#include <vector>
using namespace std;
void merge_biscuits(vector<long long> &a) {
while(a.size()<61) a.push_back(0);
for(int i=0; i<(int)a.size(); i++) {
if(a[i]>2) {
a[i+1] += (a[i]-1)/2;
a[i] = (a[i]%2 ? 1 : 2);
}
}
}
long long count_tastine... |
README.md exists but content is empty.
- Downloads last month
- 5