oj.uz

답안 #248692

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
248692 2020-07-13T07:22:36 Z leaked Pohlepko (COCI16_pohlepko) C++14
80 / 80
 56 ms 16632 KB 
#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(cout << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << 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
////////////////////////////////???????????????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) (ll)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]={1,0,-1,0};
const ll ty[4]={0,1,0,-1};
const char rev_to[4]={'E','W','N','S'};
const char o[4]={'S','P','R'};
const int N=2e3+1;
const int M=1e9+7;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
void bad(){
    cout<<-1;
    exit(0);
}
char a[N][N];
int n,m;
vector<pair<char,pii>>lol[N+N];
bool used[N][N];
void go(int lvl){
    for(auto &z : lol[lvl]){
        for(int i=0;i<2;i++){
            int nx=z.s.f+tx[i],ny=z.s.s+ty[i];
            if(nx<n && ny<m){
                if(!used[nx][ny]){
                    used[nx][ny]=1;
                    lol[lvl+1].p_b({a[nx][ny],{nx,ny}});
                }
            }
        }
    }
    sort(all(lol[lvl+1]));
    int ps=0;
    for(auto &z : lol[lvl+1]){
        if(z.f==lol[lvl+1][0].f) ps++;
    }
    lol[lvl+1].resize(ps);
}
signed main()
{
    fast_io;
    //getfiles;
    //int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
        }
    }
    lol[0].p_b({a[0][0],{0,0}});
    for(int i=0;i<n+m-2;i++){
        go(i);
    }
    for(int i=0;i<n+m-1;i++){
        cout<<lol[i][0].f;
    }
    return 0;
}
/*
    4 4
    1 2 a
    3 2 a
    1 4 a
    3 4 b




*/

Subtask #1
80.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 2 ms 2432 KB Output is correct
3 Correct 0 ms 512 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 5 ms 2048 KB Output is correct
7 Correct 20 ms 7032 KB Output is correct
8 Correct 56 ms 12280 KB Output is correct
9 Correct 1 ms 768 KB Output is correct
10 Correct 2 ms 1280 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 7 ms 4736 KB Output is correct
13 Correct 7 ms 8576 KB Output is correct
14 Correct 56 ms 12276 KB Output is correct
15 Correct 2 ms 1024 KB Output is correct
16 Correct 48 ms 16632 KB Output is correct