oj.uz

답안 #255066

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
255066 2020-07-31T07:41:17 Z leaked Kocka (COCI18_kocka) C++14
28 / 70
 1000 ms 20320 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")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
//#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 M=999999937;
const int N=100000+1;
const int ppp=73;
const int Y=1;
const int X=0;
//typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd=bind(uniform_int_distribution<ll>(1,N),mt19937(time(0)));
void bad(){
    cout<<"NE";
    exit(0);
}
const int block=317;
set<int>lol[N];
set<int>o[N];
signed main()
{
    fast_io;
    int n;
    cin>>n;
    bool ok=1;
    int x;
    vector<int>a,b,c,d;
    for(int i=0;i<n;i++){
        cin>>x;
        a.p_b(x);
        if(x==-1) continue;
        o[x].insert(i);
    }
    for(int i=0;i<n;i++){
        cin>>x;
        b.p_b(x);
        if(x==-1 && a[i]!=-1) ok=0;
        if(a[i]==-1 && x!=-1) ok=0;
        if(x==-1) continue;
        int rl=n-x-1;
        debug()<<imie(rl)<<imie(a[i]);
        if(rl<a[i]) ok=0;
        o[rl].insert(i);
    }
    for(int i=0;i<n;i++){
        cin>>x;
        c.p_b(x);
        if(x==-1 && sz(o[i])) ok=0;
        if(x==-1) continue;
        int rl=x;
        if(sz(o[i]) && (*o[i].begin())<x) ok=0;
    }
    for(int i=0;i<n;i++){
        cin>>x;
        d.p_b(x);
        if(x==-1 && (sz(o[i]) || c[i]!=-1)) ok=0;
        if(x==-1) continue;
        int rl=n-x-1;
        if(c[i]>rl) ok=0;
        if(sz(o[i]) && (*o[i].begin())>rl) ok=0;
    }
    cout<<(ok ? "DA" : "NE");
    return 0;
}
/*


*/

Compilation message

kocka.cpp: In function 'int main()':
kocka.cpp:124:13: warning: unused variable 'rl' [-Wunused-variable]
         int rl=x;
             ^~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9856 KB Output is correct
2 Correct 8 ms 9728 KB Output is correct
3 Correct 25 ms 9856 KB Output is correct
4 Correct 6 ms 9728 KB Output is correct
5 Correct 24 ms 9856 KB Output is correct
6 Correct 6 ms 9728 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 9856 KB Output is correct
2 Correct 23 ms 9856 KB Output is correct
3 Correct 22 ms 9856 KB Output is correct
4 Correct 24 ms 9856 KB Output is correct
5 Correct 25 ms 9984 KB Output is correct
6 Correct 7 ms 9728 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1094 ms 17144 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1096 ms 20320 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1073 ms 17260 KB Time limit exceeded
2 Halted 0 ms 0 KB -