| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1021920 |
2024-07-13T07:31:59 Z |
yeediot |
Tug of War (BOI15_tug) |
C++17 |
|
11 ms |
7256 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].pb(y);
}
}
}
for(int i = 1; i <= 4 * n; i++){
if(!lv[i]) tarjan(i);
}
for(int i = 1; i <= 2 * n; i++){
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
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
6748 KB |
Output is correct |
| 2 |
Correct |
5 ms |
5468 KB |
Output is correct |
| 3 |
Correct |
9 ms |
6836 KB |
Output is correct |
| 4 |
Correct |
6 ms |
5468 KB |
Output is correct |
| 5 |
Correct |
11 ms |
6748 KB |
Output is correct |
| 6 |
Correct |
5 ms |
5468 KB |
Output is correct |
| 7 |
Correct |
9 ms |
6744 KB |
Output is correct |
| 8 |
Correct |
5 ms |
5352 KB |
Output is correct |
| 9 |
Correct |
8 ms |
6652 KB |
Output is correct |
| 10 |
Correct |
5 ms |
5468 KB |
Output is correct |
| 11 |
Correct |
8 ms |
6748 KB |
Output is correct |
| 12 |
Correct |
5 ms |
5468 KB |
Output is correct |
| 13 |
Correct |
8 ms |
6748 KB |
Output is correct |
| 14 |
Correct |
8 ms |
6736 KB |
Output is correct |
| 15 |
Correct |
5 ms |
5468 KB |
Output is correct |
| 16 |
Correct |
9 ms |
6828 KB |
Output is correct |
| 17 |
Correct |
7 ms |
5464 KB |
Output is correct |
| 18 |
Correct |
8 ms |
6748 KB |
Output is correct |
| 19 |
Correct |
5 ms |
5488 KB |
Output is correct |
| 20 |
Correct |
11 ms |
6788 KB |
Output is correct |
| 21 |
Correct |
6 ms |
5212 KB |
Output is correct |
| 22 |
Correct |
9 ms |
7256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
4696 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
