oj.uz

Submission #709159

# Submission time Handle Problem Language Result Execution time Memory
709159 2023-03-13T07:05:06 Z vjudge1 Domino (COCI15_domino) C++17
100 / 160
 2867 ms 72552 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()
{  
	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<900000) 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<900000) 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>900000) {
			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();
//we

    int ttt = 1;
    // cin>>ttt;

    for(int i=1; i<=ttt; i++) {Baizho(); }
}

Compilation message

domino.cpp: In function 'void Freopen(std::string)':
domino.cpp:34:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
domino.cpp:34:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 329 ms 34448 KB Output is correct
2 Correct 146 ms 34632 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 852 KB Output is correct
2 Correct 1 ms 852 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2825 ms 72380 KB Output is correct
2 Correct 458 ms 72348 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2201 ms 68452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1436 ms 64644 KB Output is correct
2 Correct 284 ms 64444 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2804 ms 72496 KB Output is correct
2 Correct 423 ms 72324 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2867 ms 72488 KB Output is correct
2 Correct 451 ms 72392 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2787 ms 72396 KB Output is correct
2 Correct 452 ms 72552 KB Output is correct

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1236 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1558 ms 64592 KB Output is correct
2 Correct 298 ms 64452 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct

Subtask #16
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2719 ms 72472 KB Output is correct
2 Correct 461 ms 72496 KB Output is correct