Submission #709048

#TimeUsernameProblemLanguageResultExecution timeMemory
709048vjudge1Akcija (COCI15_akcija)C++17
0 / 80
1073 ms65536 KiB
#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) { st.insert({a[i][j] + a[i+1][j], {{i, j}, {i+1, j}}}); } if(j+1<=n) { st.insert({a[i][j] + a[i][j+1], {{i, j}, {i, j+1}}}); } } } 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) 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) continue; st.insert({a[x1][y1-1] + a[x2][y2+1], {{x1, y1-1}, {x2, y2+1}} }); } } int 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 (stderr)

akcija.cpp:4: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    4 | #pragma comment(linker, "/stack:2000000000")
      | 
akcija.cpp: In function 'void Freopen(std::string)':
akcija.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); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
akcija.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); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...