| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 334664 |
2020-12-09T17:31:20 Z |
NaimSS |
Nafta (COI15_nafta) |
C++14 |
|
406 ms |
56172 KB |
#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
//#define int long long
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
b%=m;
ll ans = 1;
for (; e; b = b * b % m, e /= 2)
if (e & 1) ans = ans * b % m;
return ans;
}
const int N = 2020;
ll cost[N][N];
ll have[N][N];
ll brute(int l,int r){
ll res=0;
for(int i=1;i<=l;i++){
for(int j=r;j<N;j++){
res+=have[i][j];
}
}
return res;
}
ll Cost(int l,int r){
assert(l<r);
return cost[r][r] - cost[l][r];
}
struct DP{
int n , inf;
vi dp[2];
DP(int n , int inf) : n(n) , inf(inf) {dp[0] = vi(n+1) , dp[1] = vi(n+1);}
// compute dp_cur[l], ... dp_cur[r] (inclusive)
void compute(int l, int r, int optl, int optr){
if (l > r) return;
int mid = l + (r-l)/2;
pair<int, int> best = {-inf, -1}; // se for maximizar muda pra -inf
rep(k,optl,min(mid,optr)+1){
best = max(best, { dp[0][k-1] + Cost(k-1,mid), k});
}
dp[1][mid] = best.first; int opt = best.second;
compute(l, mid - 1, optl, opt);
compute(mid + 1, r, opt, optr);
}
void solve(int k){
dp[0][0]=0;
rep(i,1,n+1){
dp[0][i] = cost[i][i];
}
int mx=0;
for(auto it : dp[0])mx=max(mx,it);
cout << mx << endl;
rep(i,2,k+1){
rep(j,0,i)dp[1][j] = dp[0][j];
rep(j,i,n+1) dp[1][j] = inf;
compute(i,n,i,n);
swap(dp[0] , dp[1]);
for(auto it : dp[0])mx=max(mx,it);
cout << mx << endl;
}
}
};
const int inf = 2e9 + 1000;
char mat[N][N];
int vis[N][N];
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};
vector<pll> add[N];
vi rem[N];
ll val[N];
int n,m;
int ok(int l,int c){
return l>=1 and l<=n and c>=1 and c<=m and !vis[l][c] and mat[l][c]!='.';
}
int32_t main(){
fastio;
cin >> n >> m;
DP dp(m,inf);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin >> mat[i][j];
}
}
rep(i,1,n+1)rep(j,1,m+1){
if(!vis[i][j] and mat[i][j]!='.'){
int A=0,B=0;
queue<pii> q;
q.push(pii(i,j));
int t=0;
int l=j,r=j;
vis[i][j]=1;
while(!q.empty()){
pii c = q.front();
q.pop();
t+=(int)(mat[c.ff][c.ss]-'0');
l=min(l,c.ss);
r=max(r,c.ss);
vis[c.ff][c.ss]=1;
rep(k,0,4){
int L = c.ff + dx[k];
int C = c.ss + dy[k];
if(ok(L,C)){
q.push(pii(L,C));
vis[L][C]=1;
}
}
}
have[l][r]+=t;
}
}
swap(n,m);
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++)if(have[i][j]){
add[i].pb(pii(j,have[i][j]));
rem[j+1].pb(have[i][j]);
}
}
ll tot=0;
for(int i=1;i<=n;i++){
for(auto it : rem[i]){
tot-=it;
val[i]+=it;
}
for(auto it : add[i]){
tot+=it.ss;
val[it.ff+1]-=it.ss;
}
ll cur = tot;
for(int j=i;j<=n;j++){
cur+=val[j];
cost[i][j] = cur;
}
}
dp.solve(n);
// math -> gcd it all
// Did u check N=1? Did you switch N,M?
}
Compilation message
nafta.cpp: In function 'int32_t main()':
nafta.cpp:125:13: warning: unused variable 'A' [-Wunused-variable]
125 | int A=0,B=0;
| ^
nafta.cpp:125:17: warning: unused variable 'B' [-Wunused-variable]
125 | int A=0,B=0;
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1004 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 7 |
Correct |
9 ms |
5484 KB |
Output is correct |
| 8 |
Correct |
10 ms |
5612 KB |
Output is correct |
| 9 |
Correct |
11 ms |
5356 KB |
Output is correct |
| 10 |
Correct |
8 ms |
4716 KB |
Output is correct |
| 11 |
Correct |
7 ms |
4716 KB |
Output is correct |
| 12 |
Correct |
6 ms |
4076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 2 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 3 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 4 |
Correct |
1 ms |
1132 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 6 |
Correct |
1 ms |
1004 KB |
Output is correct |
| 7 |
Correct |
9 ms |
5484 KB |
Output is correct |
| 8 |
Correct |
10 ms |
5612 KB |
Output is correct |
| 9 |
Correct |
11 ms |
5356 KB |
Output is correct |
| 10 |
Correct |
8 ms |
4716 KB |
Output is correct |
| 11 |
Correct |
7 ms |
4716 KB |
Output is correct |
| 12 |
Correct |
6 ms |
4076 KB |
Output is correct |
| 13 |
Correct |
283 ms |
55532 KB |
Output is correct |
| 14 |
Correct |
332 ms |
56172 KB |
Output is correct |
| 15 |
Correct |
406 ms |
55404 KB |
Output is correct |
| 16 |
Correct |
255 ms |
51820 KB |
Output is correct |
| 17 |
Correct |
205 ms |
48492 KB |
Output is correct |
| 18 |
Correct |
201 ms |
46828 KB |
Output is correct |
