oj.uz

Submission #699779

# Submission time Handle Problem Language Result Execution time Memory
699779 2023-02-18T02:24:03 Z wcwu Kocka (COCI18_kocka) C++17
70 / 70
 32 ms 4184 KB 
#include <bits/stdc++.h>
//#include<random>
using namespace std;
/*#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("O3")*/
/*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")//for codeforces*/
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef pair<int, int> pii;
typedef map<ll, ll> mll;
const int MOD1=1e9+7;
const int MOD2=998244353;
const int iINF=INT_MAX;
const ll INF=LLONG_MAX;
const ld PI=3.14159265358979323846;
ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}
ll fpow(ll a,ll b,ll m) {
    if(!b) return 1;
    ll ans=fpow(a*a%m,b/2,m);
    return (b%2?ans*a%m:ans);
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define dbg(n) cerr<<#n<<": "<<n<<"\n";
#define optline cout<<"\n";
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define irep(i,m,n) for(ll i=m;i>=n;i--)
#define F first
#define S second
#define All(c) c.begin(), c.end()
#define pb push_back
#define eb emplace_back
//#define mp make_pair
#define uni(c) c.resize(distance(c.begin(), unique(c.begin(), c.end())))
#define unisort(c) sort(c.begin(), c.end());uni(c)
const int N=1e5+5;
ll n, a[N][2];
bool flag=1;
signed main() {
    IOS
    cin>>n;
    rep(i, 2) rep(j, n) cin>>a[j][i];
    rep(i, n) {
        if(a[i][0]+a[i][1]>n || ((a[i][0]==-1 || a[i][1]==-1)&&(a[i][0]!=-1 || a[i][1]!=-1))) flag=0;
    }
    rep(i, 2) rep(j, n) cin>>a[j][i];
    rep(i, n) {
        if(a[i][0]+a[i][1]>n || ((a[i][0]==-1 || a[i][1]==-1)&&(a[i][0]!=-1 || a[i][1]!=-1))) flag=0;
    }
    if(flag) cout<<"DA\n";
    else cout<<"NE\n";
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3604 KB Output is correct
2 Correct 28 ms 4172 KB Output is correct
3 Correct 29 ms 4172 KB Output is correct
4 Correct 21 ms 3016 KB Output is correct
5 Correct 31 ms 4176 KB Output is correct
6 Correct 32 ms 4184 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3868 KB Output is correct
2 Correct 21 ms 3032 KB Output is correct
3 Correct 29 ms 4164 KB Output is correct
4 Correct 23 ms 3156 KB Output is correct
5 Correct 29 ms 4176 KB Output is correct
6 Correct 29 ms 3908 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 3660 KB Output is correct
2 Correct 22 ms 3048 KB Output is correct
3 Correct 30 ms 4180 KB Output is correct
4 Correct 28 ms 4184 KB Output is correct
5 Correct 29 ms 4172 KB Output is correct
6 Correct 21 ms 3060 KB Output is correct