# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111188 | oToToT | Palembang Bridges (APIO15_bridge) | C++14 | 314 ms | 20524 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
0 0 :
0 1
1 1
*/
#include <bits/stdc++.h>
using namespace std;
using lld = int64_t;
int k, n;
lld ans;
vector< pair< int, int > > seg;
vector< int > pos;
void init() {
cin >> k >> n;
seg.reserve( n );
for ( int i = 0 ; i < n ; ++ i ) {
string P; int S;
string Q; int T;
cin >> P >> S >> Q >> T;
ans += ( P == Q ? abs( S - T ) : 1 );
if ( P != Q ) seg.push_back( minmax( S, T ) );
}
pos.reserve( seg.size() << 1 );
for ( auto [ L, R ] : seg )
pos.push_back( L ),
pos.push_back( R );
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |