답안 #1066735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066735	2024-08-20T05:59:33 Z	12345678	Alternating Current (BOI18_alternating)	C++17	0 / 100	3000 ms	1428 KB

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.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	0 ms	348 KB	'impossible' claimed, but there is a solution
19	Halted	0 ms	0 KB	-

Subtask #2

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	0 ms	348 KB	'impossible' claimed, but there is a solution
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	0 ms	348 KB	'impossible' claimed, but there is a solution
19	Halted	0 ms	0 KB	-

Subtask #4

0 / 19.0

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

Subtask #5

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Incorrect	0 ms	348 KB	'impossible' claimed, but there is a solution
19	Halted	0 ms	0 KB	-