Submission #6239476
Source Code Expand
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg> void ps(const Arg& first) {
pr(first); ps(); // no space at end of line
}
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modular {
T val;
explicit operator T() const { return val; }
modular() { val = 0; }
template<class U> modular(const U& v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
modular operator-() const { return modular(-val); }
modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
friend modular exp(modular a, ll p) {
modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modular inv(const modular& a) {
auto i = invGeneral(a.val,MOD); assert(i != -1);
return i;
} // equivalent to return exp(b,MOD-2) if MOD is prime
modular& operator/=(const modular& m) { return (*this) *= inv(m); }
friend modular operator+(modular a, const modular& b) { return a += b; }
friend modular operator-(modular a, const modular& b) { return a -= b; }
friend modular operator*(modular a, const modular& b) { return a *= b; }
friend modular operator/(modular a, const modular& b) { return a /= b; }
};
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int N,ans;
vl A;
bool need(ll m, int i) {
vpl v; v.pb({i*m/10,(i+1)*m/10-1});
trav(t,A) {
auto V = v;
trav(a,v) {
pl r = {a.f-t,a.s-t};
ll z = r.f/m; r.f -= z*m, r.s -= z*m;
if (r.f < 0) r.f += m, r.s += m;
if (r.s >= m) V.pb({r.f,m-1}), V.pb({0,r.s-m});
else V.pb(r);
}
pl cur = {-MOD,-MOD}; sort(all(V)); v.clear();
trav(t,V) {
//ps("??",t);
if (t.f > cur.s+1) {
if (cur.s >= 0) v.pb(cur);
cur.f = t.f;
}
ckmax(cur.s,t.s);
}
v.pb(cur);
// ps("WUT",V,v,cur,t);
}
return v[0].f == 0;
}
void solve(int x) {
ll m = pow(10,x);
F0Rd(i,10) if (need(m,i)) {
ans += i;
return;
}
// ps("HUH");
}
int main() {
setIO(); re(N); A.rsz(N); re(A);
FOR(i,1,18) solve(i);
ps(ans);
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Submission Info
Submission Time |
|
Task |
B - Exact Payment |
User |
Benq |
Language |
C++14 (GCC 5.4.1) |
Score |
1500 |
Code Size |
7060 Byte |
Status |
AC |
Exec Time |
245 ms |
Memory |
384 KB |
Compile Error
./Main.cpp: In function ‘void io::setIn(std::string)’:
./Main.cpp:113:56: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
^
./Main.cpp: In function ‘void io::setOut(std::string)’:
./Main.cpp:114:58: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
^
Judge Result
Set Name |
sample |
All |
Score / Max Score |
0 / 0 |
1500 / 1500 |
Status |
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt |
All |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt, 01-54.txt, 01-55.txt, 01-56.txt, 01-57.txt, 01-58.txt, 01-59.txt, 01-60.txt, 01-61.txt, 01-62.txt, 01-63.txt, 01-64.txt, 01-65.txt, 01-66.txt, 01-67.txt, 01-68.txt, 01-69.txt, 01-70.txt, 01-71.txt, 01-72.txt, 01-73.txt, 01-74.txt, 01-75.txt, 01-76.txt, 01-77.txt, 01-78.txt, 01-79.txt, 01-80.txt, 01-81.txt, 01-82.txt, 01-83.txt, 01-84.txt, 01-85.txt, 01-86.txt, 01-87.txt, 01-88.txt, 01-89.txt, 01-90.txt, 01-91.txt, 01-92.txt, 01-93.txt, 01-94.txt, 01-95.txt, 01-96.txt, 01-97.txt, 01-98.txt, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
1 ms |
256 KB |
01-02.txt |
AC |
1 ms |
256 KB |
01-03.txt |
AC |
1 ms |
256 KB |
01-04.txt |
AC |
1 ms |
256 KB |
01-05.txt |
AC |
1 ms |
256 KB |
01-06.txt |
AC |
65 ms |
384 KB |
01-07.txt |
AC |
68 ms |
384 KB |
01-08.txt |
AC |
78 ms |
384 KB |
01-09.txt |
AC |
81 ms |
384 KB |
01-10.txt |
AC |
129 ms |
384 KB |
01-11.txt |
AC |
117 ms |
384 KB |
01-12.txt |
AC |
71 ms |
384 KB |
01-13.txt |
AC |
68 ms |
384 KB |
01-14.txt |
AC |
62 ms |
384 KB |
01-15.txt |
AC |
71 ms |
384 KB |
01-16.txt |
AC |
81 ms |
384 KB |
01-17.txt |
AC |
73 ms |
384 KB |
01-18.txt |
AC |
73 ms |
384 KB |
01-19.txt |
AC |
70 ms |
384 KB |
01-20.txt |
AC |
66 ms |
384 KB |
01-21.txt |
AC |
63 ms |
384 KB |
01-22.txt |
AC |
63 ms |
384 KB |
01-23.txt |
AC |
66 ms |
384 KB |
01-24.txt |
AC |
68 ms |
384 KB |
01-25.txt |
AC |
70 ms |
384 KB |
01-26.txt |
AC |
69 ms |
384 KB |
01-27.txt |
AC |
73 ms |
384 KB |
01-28.txt |
AC |
64 ms |
384 KB |
01-29.txt |
AC |
72 ms |
384 KB |
01-30.txt |
AC |
68 ms |
384 KB |
01-31.txt |
AC |
64 ms |
384 KB |
01-32.txt |
AC |
71 ms |
384 KB |
01-33.txt |
AC |
71 ms |
384 KB |
01-34.txt |
AC |
63 ms |
384 KB |
01-35.txt |
AC |
69 ms |
384 KB |
01-36.txt |
AC |
71 ms |
384 KB |
01-37.txt |
AC |
66 ms |
384 KB |
01-38.txt |
AC |
63 ms |
384 KB |
01-39.txt |
AC |
65 ms |
384 KB |
01-40.txt |
AC |
66 ms |
384 KB |
01-41.txt |
AC |
66 ms |
384 KB |
01-42.txt |
AC |
63 ms |
384 KB |
01-43.txt |
AC |
64 ms |
384 KB |
01-44.txt |
AC |
67 ms |
384 KB |
01-45.txt |
AC |
65 ms |
384 KB |
01-46.txt |
AC |
66 ms |
384 KB |
01-47.txt |
AC |
70 ms |
384 KB |
01-48.txt |
AC |
66 ms |
384 KB |
01-49.txt |
AC |
73 ms |
384 KB |
01-50.txt |
AC |
64 ms |
384 KB |
01-51.txt |
AC |
65 ms |
384 KB |
01-52.txt |
AC |
66 ms |
384 KB |
01-53.txt |
AC |
66 ms |
384 KB |
01-54.txt |
AC |
67 ms |
384 KB |
01-55.txt |
AC |
64 ms |
384 KB |
01-56.txt |
AC |
64 ms |
384 KB |
01-57.txt |
AC |
64 ms |
384 KB |
01-58.txt |
AC |
64 ms |
384 KB |
01-59.txt |
AC |
64 ms |
384 KB |
01-60.txt |
AC |
64 ms |
384 KB |
01-61.txt |
AC |
64 ms |
384 KB |
01-62.txt |
AC |
64 ms |
384 KB |
01-63.txt |
AC |
64 ms |
384 KB |
01-64.txt |
AC |
65 ms |
384 KB |
01-65.txt |
AC |
64 ms |
384 KB |
01-66.txt |
AC |
245 ms |
384 KB |
01-67.txt |
AC |
97 ms |
384 KB |
01-68.txt |
AC |
75 ms |
384 KB |
01-69.txt |
AC |
74 ms |
384 KB |
01-70.txt |
AC |
75 ms |
384 KB |
01-71.txt |
AC |
152 ms |
384 KB |
01-72.txt |
AC |
158 ms |
384 KB |
01-73.txt |
AC |
160 ms |
384 KB |
01-74.txt |
AC |
183 ms |
384 KB |
01-75.txt |
AC |
189 ms |
384 KB |
01-76.txt |
AC |
205 ms |
384 KB |
01-77.txt |
AC |
74 ms |
384 KB |
01-78.txt |
AC |
140 ms |
384 KB |
01-79.txt |
AC |
130 ms |
384 KB |
01-80.txt |
AC |
139 ms |
384 KB |
01-81.txt |
AC |
154 ms |
384 KB |
01-82.txt |
AC |
140 ms |
384 KB |
01-83.txt |
AC |
158 ms |
384 KB |
01-84.txt |
AC |
187 ms |
384 KB |
01-85.txt |
AC |
153 ms |
384 KB |
01-86.txt |
AC |
168 ms |
384 KB |
01-87.txt |
AC |
168 ms |
384 KB |
01-88.txt |
AC |
187 ms |
384 KB |
01-89.txt |
AC |
172 ms |
384 KB |
01-90.txt |
AC |
67 ms |
384 KB |
01-91.txt |
AC |
126 ms |
384 KB |
01-92.txt |
AC |
148 ms |
384 KB |
01-93.txt |
AC |
143 ms |
384 KB |
01-94.txt |
AC |
135 ms |
384 KB |
01-95.txt |
AC |
134 ms |
384 KB |
01-96.txt |
AC |
66 ms |
384 KB |
01-97.txt |
AC |
128 ms |
384 KB |
01-98.txt |
AC |
133 ms |
384 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |