Submission #251937

#	Time	Username	Problem	Language	Result	Execution time	Memory
251937		leaked	Spirale (COCI18_spirale)	C++14	32 / 80	26 ms	640 KiB

spirale

#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=5e2+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,125),mt19937(time(0)));
ll a[N][N];
int n,m,k;
void do_spiral(pii x,bool tp){
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int f=max(abs(i-x.f),abs(j-x.s));
            ll ss=sqr(f*2-1);
            if(tp){
                if(x.f-i==f && x.s-j!=f){
                    ss+=(j-(x.s-(f)));
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                if(j-x.s==f){
                    ss+=(i-(x.f-(f)));
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                if(i-x.f==f){
                    ss+=((x.s+f)-j);
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                ss+=((x.f+f)-i);
                a[i][j]=min(a[i][j],ss);
                continue;
            }
            else{
                if(x.f-i==f && x.s+f!=j){
                    ss+=((x.s+f)-j);
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                if(x.f-j==i){
                    ss+=((x.f+f)-i);
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                if(i-x.f==f){
                    ss+=(j-(x.s-(f)));
                    a[i][j]=min(a[i][j],ss);
                    continue;
                }
                ss+=f*2;
                ss+=(x.f+(f)-i);
                a[i][j]=min(a[i][j],ss);
                continue;
            }
        }
    }
}
signed main()
{
    fast_io;
    cin>>n>>m>>k;
    for(int i=0;i<n;i++)for(int j=0;j<m;j++) a[i][j]=inf;
    int a1,a2;bool tp;
    while(k--){
        cin>>a1>>a2>>tp;
        do_spiral({--a1,--a2},1-tp);
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) cout<<a[i][j]<<' ';
        cout<<endl;
    }
    return 0;
}
/*
0 0 0
2 1 3
3 2 7
1 3 8
1 4 2
3 5 3

/
*/

• Subtask 1: 32 / 80