oj.uz

답안 #283017

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283017 2020-08-25T08:39:05 Z 최은수(#5745) World of Tank (innopolis2018_final_E) C++17
0 / 100
 1 ms 384 KB 
#include<iostream>
#include<vector>
#include<tuple>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
bool chk[1000010][2];
tuple<int,int,int>dp[5010][2][2];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m1,m2,t;
    cin>>n>>m1>>m2>>t;
    for(int i=0;i<m1;i++)
    {
        int x;
        cin>>x;
        chk[x][0]=1;
    }
    for(int i=0;i<m2;i++)
    {
        int x;
        cin>>x;
        chk[x][1]=1;
    }
    for(int i=0;i++<n;)
        for(int j=0;j<2;j++)
            for(int k=0;k<2;k++)
                dp[i][j][k]=tuple<int,int,int>(-1,-1,-1);
    dp[0][0][0]=tuple<int,int,int>(0,-1,-1);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<2;j++)
        {
            if(chk[i][j])
                continue;
            for(int k=0;k<2;k++)
            {
                if(get<0>(dp[i][j][k])==-1&&get<0>(dp[i][j^1][k])!=-1)
                    dp[i][j][k]=tuple<int,int,int>(i,j^1,k);
                if(get<0>(dp[i][j][k])==-1)
                    continue;
                if(chk[i+1][j])
                {
                    if(k==0&&i>=t)
                        dp[i+1][j][1]=tuple<int,int,int>(i,j,k);
                }
                else
                    dp[i+1][j][k]=tuple<int,int,int>(i,j,k);
            }
        }
    }
    tuple<int,int,int>ans(-1,-1,-1);
    for(int i=0;i<2;i++)
        for(int j=0;j<2;j++)
            if(get<0>(dp[n][i][j])!=-1)
                ans=dp[n][i][j];
    if(get<0>(ans)==-1)
        return cout<<"No"<<endl,0;
    vector<int>mv;
    vector<pi>sv;
    while(get<1>(ans)!=-1)
    {
        int i=get<0>(ans);
        int j=get<1>(ans);
        int k=get<2>(ans);
        ans=dp[i][j][k];
        int nj=get<1>(ans);
        int nk=get<2>(ans);
        if(j!=nj&&nj!=-1)
            mv.eb(i);
        if(k!=nk&&nj!=-1)
            sv.eb(i-1,j);
    }
    sort(all(mv));
    sort(all(sv));
    cout<<"Yes"<<endl;
    cout<<mv.size()<<endl;
    for(int&t:mv)
        cout<<t<<' ';
    cout<<endl;
    cout<<sv.size()<<endl;
    for(pi&t:sv)
        cout<<t.fi<<' '<<t.se+1<<'\n';
    return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer parameter [name=X-coord of shot] equals to -1, violates the range [1, 20]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer parameter [name=X-coord of shot] equals to -1, violates the range [1, 20]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB [No solution found] n = 20, m1 = 12, m2 = 9, t = 3
2 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer parameter [name=X-coord of shot] equals to -1, violates the range [1, 20]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 384 KB Integer parameter [name=X-coord of shot] equals to -1, violates the range [1, 20]
2 Halted 0 ms 0 KB -