Submission #5321303
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define dump(x) cerr << #x << " = " << (x) << endl;
#define qp(f) [](auto i){return f;}
using LL=long long;
using VI=vector<int>;
using VL=vector<LL>;
using VS=vector<string>;
using VVI=vector<vector<int>>;
using PII=pair<int, int>;
const int inf = (int)1e9;
const LL MOD = 1000000007;
const double pi = acos(-1.0);
template<class T>T Sort(T & a) { sort(a.begin(), a.end()); return a; }
template<class T>T ReSort(T& a) { sort(a.rbegin(), a.rend()); return a; }
template<class T>T Reverse(T& a) { reverse(a.begin(), a.end()); return a; }
template<class T>void Unique(T& a) { a.erase(unique(a.begin(), a.end()), a.end()); }
template<class T>auto Max(T a) { return *max_element(a.begin(), a.end()); }
template<class T>auto Min(T a) { return *min_element(a.begin(), a.end()); }
template<class T, class U>int Count(T a, U c) { return count(a.begin(), a.end(), c); }
template<class T, class U>U Sum(T a, U init = 0) { return accumulate(a.begin(), a.end(), init); }
template<class T>T Age(T a, T b) { return (a + b - 1) / b; }
template<class T>T gcd(T n, T m) { return m == 0 ? n : gcd(m, n % m); }
template<class T>T lcm(T n, T m) { return n / gcd(n, m) * m; }
char Snum[] = "0123456789";
/* INPUT */
struct inputter_Str {
vector<string> inputbuffer;
string operator [](int n) { while (inputbuffer.size() <= n) { string s; cin >> s; inputbuffer.push_back(s); }return inputbuffer[n]; }
operator string() { return this[inputbuffer.size()]; }
}; inputter_Str in;
struct inputter_Int {
int operator [](int n) { return stoi(in[n]); }
operator int() { return stoi(string(in)); }
}; inputter_Int ini;
struct inputter_LL {
LL operator [](int n) { return stoll(in[n]); }
operator int() { return stoll(string(in)); }
}; inputter_LL inl;
struct inputter_Double {
double operator [](int n) { return stod(in[n]); }
operator int() { return stold(string(in)); }
}; inputter_Double ind;
VI invi(int n, int m) { VI v(m); for (int i = 0; i < m; ++i)v[i] = ini[n + i]; return v; }
VL invl(int n, int m) { VL v(m); for (int i = 0; i < m; ++i)v[i] = inl[n + i]; return v; }
int Suminvi(int n, int m) { return Sum(invi(n, m), 0); }LL Suminvl(int n, int m) { return Sum(invl(n, m), 0LL); }
int Maxinvi(int n, int m) { return Max(invi(n, m)); }LL Maxinvl(int n, int m) { return Max(invl(n, m)); }
int Mininvi(int n, int m) { return Min(invi(n, m)); }LL Mininvl(int n, int m) { return Min(invl(n, m)); }
/* OUTPUT */
struct boolswitch { string t, f; boolswitch(string tr, string fa) :t(tr), f(fa) {} }yes("yes", "no"), Yes("Yes", "No"), YES("YES", "NO"), Yay("Yay!", ":(");
struct divizer { string s; divizer(string s_) :s(s_) {} }spc(" "), nosp("");
struct outputter {
bool flag = false; boolswitch bs; divizer di;
outputter(bool f, boolswitch b, divizer d) :flag(f), bs(b), di(d) {}
template<class T>outputter operator ,(T o) {
if (flag)cout << di.s; cout << o;
outputter t(true, bs, di); return t;
}
outputter operator ,(double o) {
if (flag)cout << di.s; printf("%.20f", o);
outputter t(true, bs, di); return t;
}
outputter operator ,(bool o) {
if (flag)cout << di.s; cout << (o ? bs.t : bs.f);
outputter t(true, bs, di); return t;
}
template<class T> outputter operator ,(vector<T> o) {
if (flag)cout << di.s;
for (int i = 0; i < (int)o.size(); ++i)cout << o[i] << (i == (int)o.size() - 1 ? "" : di.s);
outputter t(true, bs, di); return t;
}
template<class T, class U> outputter operator ,(pair<T, U> o) {
if (flag)cout << di.s;
cout << "[" << o.first, ", " << o.second << "]";
outputter t(true, bs, di); return t;
}
outputter operator ,(outputter o) { cout << '\n'; return o; }
outputter operator ,(boolswitch b) { outputter t(flag, b, di); return t; }
outputter operator ,(divizer d) { outputter t(flag, bs, d); return t; }
}out(false, Yes, spc);
/* ANSWER */
struct Answer {
int mini = INT_MAX, maxi = INT_MIN, sumi = 0;
LL minl = LLONG_MAX, maxl = LLONG_MIN, suml = 0LL;
double mind = DBL_MAX, maxd = DBL_MIN, sumd = 0.;
int count = 0;
void operator =(int n) { mini = min(mini, n); maxi = max(maxi, n); sumi += n; count++; }
void operator =(LL n) { minl = min(minl, n); maxl = max(maxl, n); suml += n; count++; }
void operator =(double n) { mind = min(mind, n); maxd = max(maxd, n); sumd += n; count++; }
}ans;
int re(string s) {
if (s[0] == '0' || s[3] == '0')return -inf;
int a = stoi(s.substr(0, 3)), b = stoi(s.substr(3, 3));
return a - b;
}
int main() {
int a = ini[0], b = ini[1];
string s = to_string(a) + to_string(b);
rep(i, 6)rep(j, 10) {
string t = s; t[i] = Snum[j];
ans = re(t);
}
out, ans.maxi, out;
}
Submission Info
Submission Time |
|
Task |
A - A - B problem |
User |
yuruhiya |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4966 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_0.txt, sample_1.txt, sample_2.txt |
All |
ansneg_0.txt, ansneg_1.txt, ansneg_2.txt, ansneg_3.txt, ansneg_4.txt, ansneg_5.txt, ansneg_6.txt, ansneg_7.txt, ansneg_8.txt, ansneg_9.txt, handmade_0.txt, handmade_1.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_0.txt, sample_1.txt, sample_2.txt, top2fixed_0.txt, top2fixed_1.txt, top2fixed_2.txt, top2fixed_3.txt, top2fixed_4.txt, top2fixed_5.txt, top2fixed_6.txt, top2fixed_7.txt, top2fixed_8.txt, top2fixed_9.txt, topfixed_0.txt, topfixed_1.txt, topfixed_2.txt, topfixed_3.txt, topfixed_4.txt, topfixed_5.txt, topfixed_6.txt, topfixed_7.txt, topfixed_8.txt, topfixed_9.txt |
Case Name |
Status |
Exec Time |
Memory |
ansneg_0.txt |
AC |
1 ms |
256 KB |
ansneg_1.txt |
AC |
1 ms |
256 KB |
ansneg_2.txt |
AC |
1 ms |
256 KB |
ansneg_3.txt |
AC |
1 ms |
256 KB |
ansneg_4.txt |
AC |
1 ms |
256 KB |
ansneg_5.txt |
AC |
1 ms |
256 KB |
ansneg_6.txt |
AC |
1 ms |
256 KB |
ansneg_7.txt |
AC |
1 ms |
256 KB |
ansneg_8.txt |
AC |
1 ms |
256 KB |
ansneg_9.txt |
AC |
1 ms |
256 KB |
handmade_0.txt |
AC |
1 ms |
256 KB |
handmade_1.txt |
AC |
1 ms |
256 KB |
random_0.txt |
AC |
1 ms |
256 KB |
random_1.txt |
AC |
1 ms |
256 KB |
random_2.txt |
AC |
1 ms |
256 KB |
random_3.txt |
AC |
1 ms |
256 KB |
random_4.txt |
AC |
1 ms |
256 KB |
random_5.txt |
AC |
1 ms |
256 KB |
random_6.txt |
AC |
1 ms |
256 KB |
random_7.txt |
AC |
1 ms |
256 KB |
random_8.txt |
AC |
1 ms |
256 KB |
random_9.txt |
AC |
1 ms |
256 KB |
sample_0.txt |
AC |
1 ms |
256 KB |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
top2fixed_0.txt |
AC |
1 ms |
256 KB |
top2fixed_1.txt |
AC |
1 ms |
256 KB |
top2fixed_2.txt |
AC |
1 ms |
256 KB |
top2fixed_3.txt |
AC |
1 ms |
256 KB |
top2fixed_4.txt |
AC |
1 ms |
256 KB |
top2fixed_5.txt |
AC |
1 ms |
256 KB |
top2fixed_6.txt |
AC |
1 ms |
256 KB |
top2fixed_7.txt |
AC |
1 ms |
256 KB |
top2fixed_8.txt |
AC |
1 ms |
256 KB |
top2fixed_9.txt |
AC |
1 ms |
256 KB |
topfixed_0.txt |
AC |
1 ms |
256 KB |
topfixed_1.txt |
AC |
1 ms |
256 KB |
topfixed_2.txt |
AC |
1 ms |
256 KB |
topfixed_3.txt |
AC |
1 ms |
256 KB |
topfixed_4.txt |
AC |
1 ms |
256 KB |
topfixed_5.txt |
AC |
1 ms |
256 KB |
topfixed_6.txt |
AC |
1 ms |
256 KB |
topfixed_7.txt |
AC |
1 ms |
256 KB |
topfixed_8.txt |
AC |
1 ms |
256 KB |
topfixed_9.txt |
AC |
1 ms |
256 KB |