oj.uz

답안 #1051923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051923 2024-08-10T10:37:00 Z otarius Alternating Current (BOI18_alternating) C++17
0 / 100
 12 ms 3160 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 1e5 + 25;

void solve() {
    int n, m;
    cin >> n >> m;
    pii v[m];
    for (int i = 0; i < m; i++) {
        cin >> v[i].ff >> v[i].sc;
    } sort(v, v + m);
    int x = 0, y = 0, ans[m];
    for (int i = 0; i < m; i++) {
        if (x > y) {
            ans[i] = 1; y = max(y, v[i].sc);
        } else {
            ans[i] = 0; x = max(x, v[i].ff);
        }
    } int xx[n + 5] = {}, yy[n + 5] = {};
    for (int i = 0; i < m; i++) {
        if (ans[i] == 0) {
            xx[v[i].ff]++;
            xx[v[i].sc + 1]--;
        } else {
            yy[v[i].ff]++;
            yy[v[i].sc + 1]--;
        }
    } for (int i = 1; i <= n; i++) {
        xx[i] += xx[i - 1];
        yy[i] += yy[i - 1];
        if (!xx[i] || !yy[i]) {
            cout << "impossible"; return;
        }
    } for (int i = 0; i < m; i++) cout << ans[i];
}
int32_t main() { 
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
    return 0;
}

Compilation message

alternating.cpp: In function 'void open_file(std::string)':
alternating.cpp:26:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
alternating.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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 Incorrect 0 ms 348 KB 'impossible' claimed, but there is a solution
4 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 Incorrect 0 ms 348 KB 'impossible' claimed, but there is a solution
4 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 Incorrect 0 ms 348 KB 'impossible' claimed, but there is a solution
4 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 3160 KB Output is correct
2 Correct 1 ms 1112 KB Output is correct
3 Correct 5 ms 2392 KB Output is correct
4 Incorrect 6 ms 2392 KB no wires in direction 1 between segments 1 and 1
5 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 Incorrect 0 ms 348 KB 'impossible' claimed, but there is a solution
4 Halted 0 ms 0 KB -