oj.uz

답안 #241684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241684 2020-06-25T09:11:42 Z SorahISA Checker (COCI19_checker) C++17
23 / 110
 302 ms 29688 KB 
// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(1, 1E8); \
                 auto rnd = bind(__dis, __gen)

const int INF = 1E18;
const int mod = 1E9 + 7;

int32_t main() {
    fastIO();
    
    int sub, n;
    cin >> sub >> n;
    
    vector<pii> col[n+1]; /// (id , col)
    for (int i = 1; i <= n; ++i) {
        char c; cin >> c;
        col[i].eb(i%n+1, c^'0');
        col[i%n+1].eb(i, c^'0');
    }
    
    for (int i = 1; i <= n-3; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        col[a].eb(b, c);
        col[b].eb(a, c);
    }
    
    for (int i = 1; i <= n; ++i) {
        sort(ALL(col[i]), [=](auto a, auto b) {
            return (a.X - i + n) % n < (b.X - i + n) % n;
        });
        // for (auto x : col[i]) cout << x.Y << " "; cout << "\n";
        int sz = col[i].size();
        for (int j = 1; j < sz; ++j) {
            if (col[i][j].Y == col[i][j-1].Y) return cout << "neispravno bojenje\n", 0;
        }
    }
    
    cout << "tocno\n";
    
    return 0;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 265 ms 29668 KB Output is correct
2 Correct 302 ms 29560 KB Output is correct
3 Incorrect 218 ms 29560 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 246 ms 29688 KB Output is correct
2 Correct 272 ms 29688 KB Output is correct
3 Correct 296 ms 29648 KB Output is correct
4 Correct 229 ms 29564 KB Output is correct
5 Correct 227 ms 29560 KB Output is correct
6 Correct 289 ms 29388 KB Output is correct
7 Correct 257 ms 29396 KB Output is correct
8 Correct 193 ms 29264 KB Output is correct
9 Correct 204 ms 29268 KB Output is correct

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -