| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 101893 |
2019-03-20T20:46:50 Z |
Benq |
Nafta (COI15_nafta) |
C++14 |
|
387 ms |
93048 KB |
#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 beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 2005;
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); }
template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }
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; trav(a,x) pr(!fst?", ":"",a), fst = 0;
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, 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 modInt {
T val;
T mod = 0;
// static const T mod = MOD;
void normalize() {
if (mod == 0) return;
val %= mod; if (val < 0) val += mod;
}
modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
// modInt(T v = 0, T m = 0) : val(v) { normalize(); }
explicit operator T() const { return val; }
friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }
friend void check(modInt& a, modInt& b) { // make sure all operations are valid
// comment out if mod is static const
if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
if (a.mod != mod) { a.mod = mod; a.normalize(); }
if (b.mod != mod) { b.mod = mod; b.normalize(); }
}
friend modInt operator+(modInt a, modInt b) {
check(a,b); a.val += (T)b;
if (a.val >= a.mod) a.val -= a.mod;
return a;
}
friend modInt operator-(modInt a, modInt b) {
check(a,b); a.val -= (T)b;
if (a.val < 0) a.val += a.mod;
return a;
}
friend modInt operator-(const modInt& a) { return modInt(0)-a; }
friend modInt operator*(modInt a, modInt b) {
check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
}
friend modInt exp(modInt a, ll p) {
modInt ans(1,a.mod);
for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modInt inv(const modInt& a) {
return {invGeneral(a.val,a.mod),a.mod};
// return exp(b,b.mod-2) if prime
}
friend modInt operator/(modInt a, modInt b) {
check(a,b); return a*inv(b);
}
};
typedef modInt<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int R,S, cum[MX][MX];
bool vis[MX][MX];
string s[MX];
pi bound;
int sum, tot;
void dfs(int r, int c) {
if (r < 0 || r >= R || c < 0 || c >= S) return;
if (s[r][c] == '.' || vis[r][c]) return;
vis[r][c] = 1;
ckmin(bound.f,c), ckmax(bound.s,c); sum += s[r][c]-'0';
dfs(r+1,c), dfs(r-1,c), dfs(r,c+1), dfs(r,c-1);
}
int dp[MX][MX];
int getSum(int l, int r) {
if (l+1 >= r) return 0;
return cum[l+1][r-1];
}
void divi(int ind, int l, int r, int lo, int hi) {
if (l > r) return;
int m = (l+r)/2;
pi bes = {MOD,MOD};
FOR(i,lo,min(m,hi)+1) ckmin(bes,{dp[ind-1][i]+getSum(i,m),i});
dp[ind][m] = bes.f;
divi(ind,l,m-1,lo,bes.s), divi(ind,m+1,r,bes.s,hi);
}
int main() {
setIO(); re(R,S); F0R(i,R) re(s[i]);
F0R(i,R) F0R(j,S) if (s[i][j] != '.' && !vis[i][j]) {
bound = {MOD,-MOD}; sum = 0;
dfs(i,j);
cum[bound.f+1][bound.s+1] += sum;
tot += sum;
}
FORd(i,1,S+1) FOR(j,i+1,S+1) {
cum[i][j] += cum[i+1][j]; cum[i][j] += cum[i][j-1];
if (i+2 <= j) cum[i][j] -= cum[i+1][j-1];
// ps("WHAT",i,j,cum[i][j]);
}
FOR(i,1,S+2) dp[0][i] = MOD;
FOR(j,1,S+2) {
divi(j,1,S+1,0,S);
if (j > 1) ps(tot-dp[j][S+1]);
// F0R(z,S+1) cout << dp[j][z] << " ";
// cout << "\n";
}
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Compilation message
nafta.cpp: In function 'void io::setIn(std::__cxx11::string)':
nafta.cpp:117:35: 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); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~
nafta.cpp: In function 'void io::setOut(std::__cxx11::string)':
nafta.cpp:118:36: 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); }
~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1024 KB |
Output is correct |
| 3 |
Correct |
3 ms |
896 KB |
Output is correct |
| 4 |
Correct |
2 ms |
896 KB |
Output is correct |
| 5 |
Correct |
2 ms |
896 KB |
Output is correct |
| 6 |
Correct |
3 ms |
896 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1024 KB |
Output is correct |
| 3 |
Correct |
3 ms |
896 KB |
Output is correct |
| 4 |
Correct |
2 ms |
896 KB |
Output is correct |
| 5 |
Correct |
2 ms |
896 KB |
Output is correct |
| 6 |
Correct |
3 ms |
896 KB |
Output is correct |
| 7 |
Correct |
9 ms |
4096 KB |
Output is correct |
| 8 |
Correct |
9 ms |
4096 KB |
Output is correct |
| 9 |
Correct |
11 ms |
5376 KB |
Output is correct |
| 10 |
Correct |
12 ms |
4096 KB |
Output is correct |
| 11 |
Correct |
10 ms |
4160 KB |
Output is correct |
| 12 |
Correct |
8 ms |
4096 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
2 ms |
1024 KB |
Output is correct |
| 3 |
Correct |
3 ms |
896 KB |
Output is correct |
| 4 |
Correct |
2 ms |
896 KB |
Output is correct |
| 5 |
Correct |
2 ms |
896 KB |
Output is correct |
| 6 |
Correct |
3 ms |
896 KB |
Output is correct |
| 7 |
Correct |
9 ms |
4096 KB |
Output is correct |
| 8 |
Correct |
9 ms |
4096 KB |
Output is correct |
| 9 |
Correct |
11 ms |
5376 KB |
Output is correct |
| 10 |
Correct |
12 ms |
4096 KB |
Output is correct |
| 11 |
Correct |
10 ms |
4160 KB |
Output is correct |
| 12 |
Correct |
8 ms |
4096 KB |
Output is correct |
| 13 |
Correct |
292 ms |
42048 KB |
Output is correct |
| 14 |
Correct |
303 ms |
42104 KB |
Output is correct |
| 15 |
Correct |
387 ms |
93048 KB |
Output is correct |
| 16 |
Correct |
244 ms |
41976 KB |
Output is correct |
| 17 |
Correct |
303 ms |
41976 KB |
Output is correct |
| 18 |
Correct |
308 ms |
42100 KB |
Output is correct |
