oj.uz

답안 #623404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623404 2022-08-05T14:26:48 Z Theo830 DEL13 (info1cup18_del13) C++17
40 / 100
 7 ms 4052 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll dp[100005][3];
vll arr;
ll siz;
bool solve(ll idx,ll last){
    ll num = arr[idx] - last;
    if(num < 0){
        return false;
    }
    if(idx == siz-1){
        if(num % 2 == 0){
            if(last == 0 && arr[idx] != 0){
                return false;
            }
            return true;
        }
        return false;
    }
    if(dp[idx][last] != -1){
        return dp[idx][last];
    }
    bool ok = 0;
    if(num % 2 == 0){
        if(num >= 2){
            ok |= solve(idx + 1,2);
        }
        if(num == 0 || last != 0){
            ok |= solve(idx + 1,0);
        }
    }
    else{
        ok = solve(idx + 1,1);
    }
    return dp[idx][last] = ok;
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin>>t;
    while(t--){
        ll n,r;
        cin>>n>>r;
        ll last = 0;
        arr.clear();
        f(i,0,r){
            ll a;
            cin>>a;
            arr.pb(a - last - 1);
            last = a;
        }
        arr.pb(n - last);
        siz = arr.size();
        f(i,0,siz+5){
            f(j,0,3){
                dp[i][j] = -1;
            }
        }
        f(i,0,siz){
            if(arr[i] > 4){
                if(arr[i] % 2 == 0){
                    arr[i] = 4;
                }
                else{
                    arr[i] = 3;
                }
            }
        }
        bool ok = solve(0,0);
        if(!ok){
            cout<<"-1\n";
        }
        else{
            cout<<"0\n";
            cout<<"\n";
        }
    }
}

Compilation message

del13.cpp: In function 'bool solve(ll, ll)':
del13.cpp:57:26: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   57 |     return dp[idx][last] = ok;
      |            ~~~~~~~~~~~~~~^~~~

Subtask #1
6.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is partially correct
2 Correct 1 ms 212 KB Output is partially correct

Subtask #2
6.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is partially correct
2 Correct 1 ms 212 KB Output is partially correct
3 Correct 3 ms 340 KB Output is partially correct
4 Correct 4 ms 340 KB Output is partially correct

Subtask #3
6.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is partially correct
2 Correct 1 ms 468 KB Output is partially correct

Subtask #4
10.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is partially correct
2 Correct 1 ms 212 KB Output is partially correct
3 Correct 3 ms 340 KB Output is partially correct
4 Correct 4 ms 340 KB Output is partially correct
5 Correct 1 ms 340 KB Output is partially correct
6 Correct 1 ms 340 KB Output is partially correct
7 Correct 1 ms 340 KB Output is partially correct

Subtask #5
12.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is partially correct
2 Correct 1 ms 212 KB Output is partially correct
3 Correct 3 ms 340 KB Output is partially correct
4 Correct 4 ms 340 KB Output is partially correct
5 Correct 1 ms 340 KB Output is partially correct
6 Correct 1 ms 340 KB Output is partially correct
7 Correct 1 ms 340 KB Output is partially correct
8 Correct 5 ms 980 KB Output is partially correct
9 Correct 7 ms 2264 KB Output is partially correct
10 Correct 5 ms 2320 KB Output is partially correct
11 Correct 6 ms 4052 KB Output is partially correct