# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037789 | Halym2007 | Palembang Bridges (APIO15_bridge) | C++17 | 1 ms | 2408 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.
#include "bits/stdc++.h"
#define ll long long int
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
#define sz size()
const int N = 2e5 + 1;
using namespace std;
int n, k, a[N], b[N];
ll ans, p[N];
char s[N], d[N];
vector <ll> v;
int main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> k >> n;
v.pb(0);
for(int i = 1; i <= n; i++){
cin >> s[i] >> a[i] >> d[i] >> b[i];
if(s[i] == d[i]) ans += abs(a[i] - b[i]);
else{
v.pb(a[i]);
v.pb(b[i]);
# | 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... |