제출 #1066735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066735		12345678	Alternating Current (BOI18_alternating)	C++17	0 / 100	3072 ms	1428 KiB

alternating

#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5;

int n, m, a[nx], b[nx], cur[nx], dp[nx], res[nx];
vector<pair<int, int>> v;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m;
    for (int i=0; i<m; i++) 
    {
        cin>>a[i]>>b[i];
        if (a[i]<=b[i]) for (int j=a[i]; j<=b[i]; j++) cur[j]++;
        else
        {
            for (int j=a[i]; j<=n; j++) cur[j]++;
            for (int j=1; j<=b[i]; j++) cur[j]++;
        }
    }
    for (int i=0; i<m; i++)
    {
        int mn=INT_MAX;
        if (a[i]<=b[i]) for (int j=a[i]; j<=b[i]; j++) mn=min(mn, cur[j]);
        else
        {
            for (int j=a[i]; j<=n; j++) mn=min(mn, cur[j]);
            for (int j=1; j<=b[i]; j++) mn=min(mn, cur[j]);
        }
        if (mn>=2)
        {
            res[i]=1;
            if (a[i]<=b[i]) for (int j=a[i]; j<=b[i]; j++) cur[j]--, dp[j]++;
            else
            {
                for (int j=a[i]; j<=n; j++) cur[j]--, dp[j]++;
                for (int j=1; j<=b[i]; j++) cur[j]--, dp[j]++;
            }
        }
    }
    for (int i=1; i<=n; i++) if (dp[i]==0) return cout<<"impossible", 0;
    for (int i=0; i<m; i++) cout<<res[i];
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 20
• Subtask 3: 0 / 22
• Subtask 4: 0 / 19
• Subtask 5: 0 / 26