#include "scales.h"
/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
//const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "ioi")
freopen((s + ".out").c_str(), "w", stdout);
}
}
void init(int t)
{
//cool
}
int l;
map<pii,int>c;
void orderCoins()
{
c.clear();
l = 1;
l = getLightest(l, 2, 3);
l = getLightest(l, 4, 5);
l = getLightest(l, (l == 5 ? 1 : 5), 6);
const int n = 6;
vi a(n);
iota(all(a), 1);
a.erase(find(all(a), l));
sort(all(a), [](int i, int j)
{
int x=0;// = getHeaviest(l, i, j);
if(c.count({i,j}))x = c[{i,j}];
else x = getHeaviest(l,i,j);
c[{i,j}] = x;
c[{j,i}] = x;
if (x == i)return 0;
return 1;
}
);
a.insert(a.begin(), l);
int ans[n];
F0R(i, n)ans[i] = a[i];
answer(ans);
}
Compilation message
scales.cpp: In function 'void init(int)':
scales.cpp:60:15: warning: unused parameter 't' [-Wunused-parameter]
60 | void init(int t)
| ~~~~^
scales.cpp: In function 'void setIO(std::string)':
scales.cpp:55:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
55 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
scales.cpp:57:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
57 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 2 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 3 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 4 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 5 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 6 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 7 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 8 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 9 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 10 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 11 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 12 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 13 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 14 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 15 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 16 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 17 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 18 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 19 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 20 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 21 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 22 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 23 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 24 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 25 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 26 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 27 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 28 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 29 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 30 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 31 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 32 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 33 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 34 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 35 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 36 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 37 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 38 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 39 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
| 40 |
Partially correct |
1 ms |
364 KB |
Output is partially correct |
