oj.uz

답안 #1021922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1021922 2024-07-13T07:37:15 Z yeediot Tug of War (BOI15_tug) C++17
23 / 100
 12 ms 7524 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 30005;
int n, k, lv[mxn * 4], low[mxn * 4], scc[mxn * 4], cnt, timer;
vector<int>adj[mxn * 4], l[mxn], r[mxn], st;
void tarjan(int v){
    low[v] = lv[v] = ++timer;
    st.pb(v);
    for(auto u : adj[v]){
        if(!lv[u]){
            tarjan(u);
            chmin(low[v], low[u]);
        }
        else if(!scc[u]){
            chmin(low[v], lv[u]);
        }
    }
    if(low[v] == lv[v]){
        cnt++;
        int k;
        do{
            k = st.back();
            st.pop_back();
            scc[k] = cnt;
        }while(k != v);
    }
}
void solve(){
    cin >> n >> k;
    for(int i = 1; i <= 2 * n; i++){
        int L, R, s;
        cin >> L >> R >> s;
        l[L].pb(i);
        r[R].pb(i);
    }
    for(int i = 1; i <= n; i++){
        if(sz(l[i]) == 0 or sz(r[i]) == 0){
            cout << "NO\n";
            return;
        }
    }
    for(int i = 1; i <= n; i++){
        for(auto x : l[i]){
            for(auto y : l[i]){
                if(x == y) continue;
                adj[x].pb(y + 2 * n);
            }
        }
        for(auto x : r[i]){
            for(auto y : r[i]){
                if(x == y) continue;
                adj[x + 2 * n].pb(y);
            }
        }
    }
    for(int i = 1; i <= 4 * n; i++){
        if(!lv[i]) tarjan(i);
    }
    for(int i = 1; i <= 2 * n; i++){
        debug(scc[i], scc[i + 2 * n]);
        if(scc[i] == scc[i + 2 * n]){
            cout << "NO\n";
            return;
        }
    }
    cout << "YES\n";
}
signed main(){
    TOI_is_so_de;
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
    function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
        std::ifstream file1(p1);
        std::ifstream file2(p2);
        if(!file1.is_open() || !file2.is_open()) return false;
        std::string line1, line2;
        while (getline(file1, line1) && getline(file2, line2)) {
            if (line1 != line2)return false;
        }
        int cnta = 0, cntb = 0;
        while(getline(file1,line1))cnta++;
        while(getline(file2,line2))cntb++;
        return cntb - cnta <= 1;
    };
    bool check = compareFiles("output.txt","expected.txt");
    if(check) cerr<<"ACCEPTED\n";
    else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7516 KB Output is correct
2 Correct 5 ms 5468 KB Output is correct
3 Correct 9 ms 7524 KB Output is correct
4 Correct 6 ms 5468 KB Output is correct
5 Correct 9 ms 7516 KB Output is correct
6 Correct 6 ms 5468 KB Output is correct
7 Correct 11 ms 7512 KB Output is correct
8 Correct 6 ms 5468 KB Output is correct
9 Correct 9 ms 7516 KB Output is correct
10 Correct 5 ms 5468 KB Output is correct
11 Correct 8 ms 7320 KB Output is correct
12 Correct 5 ms 5452 KB Output is correct
13 Correct 9 ms 7516 KB Output is correct
14 Correct 10 ms 7344 KB Output is correct
15 Correct 5 ms 5468 KB Output is correct
16 Correct 8 ms 7296 KB Output is correct
17 Correct 6 ms 5468 KB Output is correct
18 Correct 12 ms 7436 KB Output is correct
19 Correct 6 ms 5468 KB Output is correct
20 Correct 9 ms 7500 KB Output is correct
21 Correct 6 ms 5212 KB Output is correct
22 Correct 11 ms 7260 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -