# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1159500 | Seb | Scales (IOI15_scales) | C++17 | 0 ms | 320 KiB |
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
struct query{
int id, a, b, c, d, score;
query(int id, int a, int b, int c, int d):
id(id), a(a), b(b), c(c), d(d), score(0) {}
query(): id(0), a(0), b(0), c(0), d(0), score(0) {}
};
struct caso{
array<int, 6> ar; int val;
caso(): val(0) {
for (int i = 0; i < 6; i++)
ar[i] = 0;
}
};
vector<caso> posi;
caso aux = caso();
int vis[7], cnt;
vector<query> ans;
void genera(int idx = 0) {
if (idx == 6) {
posi.push_back(aux);
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |