| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 709176 | 2023-03-13T07:15:53 Z | vjudge1 | Domino (COCI15_domino) | C++17 | 3250 ms | 78900 KB |
#include <bits/stdc++.h>
using namespace std;
// #pragma comment(linker, "/stack:2000000000")
// #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define precise(a) cout<<fixed<<setprecision(a)
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
// t1
const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const ll N = ll(1e6)+10;
const ll K = 17;
const ll inf = 4e18;
const ld eps = 1e-15L;
// const ll B = 316;
// const ld pie = acos(-1.0);
ll lcm(ll a, ll b){ return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
void precalc() {
}
bool took[2005][2005];
set<pair<int, pair<pair<int, int> , pair<int, int> > > >st;
int a[2005][2005];
int n, k;
void Baizho()
{
ll lim = 1000000;
cin>>n>>k;
for(ll i=1; i<=n; i++) {
for(ll j=1; j<=n; j++) {
cin>>a[i][j];
}
}
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
if(i+1<=n) {
if(st.sz<lim) st.insert({a[i][j] + a[i+1][j], {{i, j}, {i+1, j}}});
else {
if((*st.begin()).ff<a[i][j] + a[i+1][j]) {
st.insert({a[i][j] + a[i+1][j], {{i, j}, {i+1, j}}});
st.erase(st.begin());
}
}
}
if(j+1<=n) {
if(st.sz<lim) st.insert({a[i][j] + a[i][j+1], {{i, j}, {i, j+1}}});
else {
if((*st.begin()).ff<a[i][j] + a[i][j+1]) {
st.insert({a[i][j] + a[i][j+1], {{i, j}, {i, j+1}}});
st.erase(st.begin());
}
}
}
}
}
while(k--) {
auto get = *st.rbegin();
int x1 = get.ss.ff.ff, y1 = get.ss.ff.ss;
int x2 = get.ss.ss.ff, y2 = get.ss.ss.ss;
st.erase(get);
if(took[x1][y1] || took[x2][y2]) {
k++;
continue;
}
took[x1][y1] = took[x2][y2] = 1;
if(y1==y2) {
// down domino
if(x1-1<1 || x2+1>n || took[x1-1][y1] || took[x2+1][y2]) continue;
st.insert({a[x1-1][y1] + a[x2+1][y2], {{x1-1, y1}, {x2+1, y2}} });
}
if(x1==x2) {
if(y1-1<1 || y2+1>n || took[x1][y1-1] || took[x2][y2+1]) continue;
st.insert({a[x1][y1-1] + a[x2][y2+1], {{x1, y1-1}, {x2, y2+1}} });
}
if(st.sz>lim) {
st.erase(st.begin());
}
}
ll ans = 0;
for(int i=1; i<=n; i++) {
for(int j=1; j<=n; j++) {
if(took[i][j]) continue;
ans+=a[i][j];
}
}
cout<<ans;
}
int main() {
// Freopen("div7");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 389 ms | 34448 KB | Output is correct |
| 2 | Correct | 165 ms | 34552 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 852 KB | Output is correct |
| 2 | Correct | 1 ms | 852 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3235 ms | 78760 KB | Output is correct |
| 2 | Correct | 509 ms | 78648 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2542 ms | 74808 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1695 ms | 70856 KB | Output is correct |
| 2 | Correct | 335 ms | 70712 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3231 ms | 78816 KB | Output is correct |
| 2 | Correct | 466 ms | 78744 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 1 ms | 852 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3098 ms | 78632 KB | Output is correct |
| 2 | Correct | 499 ms | 78676 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 6 ms | 1964 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 0 ms | 340 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3250 ms | 78636 KB | Output is correct |
| 2 | Correct | 560 ms | 78692 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 5 ms | 1236 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 1574 ms | 70956 KB | Output is correct |
| 2 | Correct | 335 ms | 70724 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 340 KB | Output is correct |
| 2 | Correct | 0 ms | 340 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 3140 ms | 78704 KB | Output is correct |
| 2 | Correct | 551 ms | 78900 KB | Output is correct |