| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 783085 |
2023-07-14T15:10:07 Z |
tolbi |
Wombats (IOI13_wombats) |
C++17 |
|
8 ms |
15956 KB |
#pragma optimize("Bismillahirrahmanirrahim")
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█■█
//█─█─█▄─█▄─█─█─█─█
//Allahuekber
//ahmet23 orz...
//FatihSultanMehmedHan
//YavuzSultanSelimHan
//AbdulhamidHan
//Sani buyuk Osman Pasa Plevneden cikmam diyor
#define author tolbi
#include<bits/stdc++.h>
using namespace std;
template<typename X, typename Y> ostream& operator<<(ostream& os, pair<X,Y> pr){return os<<pr.first<<" "<<pr.second;}
template<typename X> ostream& operator<<(ostream& os, vector<X> v){for (auto &it : v) os<<it; return os;}
template<typename X, size_t Y> ostream& operator<<(ostream& os, array<X,Y> v){for (auto &it : v) os<<it; return os;}
#define endl '\n'
#define deci(x) int x;cin>>x;
#define decstr(x) string x;cin>>x;
#define vint(x) vector<int> x
#define sortarr(x) sort(x.begin(), x.end())
#define sortrarr(x) sort(x.rbegin(), x.rend())
#define rev(x) reverse(x.begin(), x.end())
#define tol(bi) (1LL<<((long long)(bi)))
#define coutarr(x) for (auto &it : x) cout<<it<<" ";cout<<endl;
typedef long long ll;
const ll INF = 1e15;
const int MOD = 1e9+7;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "wombats.h"
ll segtree[16384][100][100];
int n, m;
ll v[5000][100],h[5000][100];
int opt[200][100];
int segsize;
void merge(int node){
if (node*2+1>=segsize){
int pos = node-segsize/2;
if (pos>=n){
for (int i = 0; i < m; ++i)
{
for (int j = 0; j < m; j++){
if (i==j) segtree[node][i][j]=0;
else segtree[node][i][j]=INF;
}
}
return;
}
for (int i = 0; i < m; i++){
ll crr = 0;
for (int j = i; j < m; j++){
segtree[node][i][j]=crr+v[pos][j];
if (j<m-1) crr+=h[pos][j];
}
crr=0;
for (int j = i; j >= 0; j--){
segtree[node][i][j]=crr+v[pos][j];
if (j>0) crr+=h[pos][j-1];
}
}
return;
}
int up = node*2+1;
int down = node*2+2;
for (int i = m-1; i >= 0; i--){
for (int j = 0; j < m; j++){
int lrang=0;
if (j>0) lrang=max(lrang,opt[i][j-1]);
int rrang=m-1;
if (i<m-1) rrang=min(rrang,opt[i+1][j]);
segtree[node][i][j]=segtree[up][i][lrang]+segtree[down][lrang][j];
opt[i][j]=lrang;
for (int k = lrang; k <= rrang; k++){
if (segtree[up][i][k]+segtree[down][k][j]<segtree[node][i][j]){
segtree[node][i][j]=segtree[up][i][k]+segtree[down][k][j];
opt[i][j]=k;
}
}
}
}
}
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n=R,m=C;
for (int i = 0; i < 5000; i++){
for (int j = 0; j < 200; j++){
if (i<R-1 && j<C) v[i][j]=V[i][j];
else v[i][j]=0ll;
if (i<R && j<C-1) h[i][j]=H[i][j];
else h[i][j]=0ll;
}
}
segsize=tol(ceil(log2(n)+1))-1,0ll;
for (int i = segsize-1; i >= 0; i--){
merge(i);
}
}
void changeH(int P, int Q, int W) {
h[P][Q]=W;
P+=segsize/2;
merge(P);
while (P>0){
P=(P-1)/2;
merge(P);
}
}
void changeV(int P, int Q, int W) {
v[P][Q]=W;
P+=segsize/2;
merge(P);
while (P>0){
P=(P-1)/2;
merge(P);
}
}
int escape(int V1, int V2) {
return segtree[0][V1][V2];
return 23;
}
Compilation message
grader.c: In function 'int main()':
grader.c:15:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
15 | int res;
| ^~~
wombats.cpp:1: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
1 | #pragma optimize("Bismillahirrahmanirrahim")
|
wombats.cpp: In function 'void init(int, int, int (*)[200], int (*)[200])':
wombats.cpp:92:36: warning: right operand of comma operator has no effect [-Wunused-value]
92 | segsize=tol(ceil(log2(n)+1))-1,0ll;
| ^
cc1plus: warning: iteration 100 invokes undefined behavior [-Waggressive-loop-optimizations]
wombats.cpp:85:21: note: within this loop
85 | for (int j = 0; j < 200; j++){
| ~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
11988 KB |
Output is correct |
| 2 |
Incorrect |
6 ms |
11988 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8148 KB |
Output is correct |
| 2 |
Incorrect |
5 ms |
8148 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
8396 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
8 ms |
15956 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
8332 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
8276 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
