# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14386 | woqja125 | Palembang Bridges (APIO15_bridge) | C++14 | 109 ms | 5996 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<stdio.h>
#include<queue>
#include<algorithm>
#include<vector>
long long abs(long long x){return x>0?x:-x;}
void solve1();
void solve2();
struct person
{
int l, r;
};
bool operator<(const person &A, const person &B){return A.l+A.r<B.l+B.r;}
int k, N=0;
long long ans=0;
person l[100001];
int main()
{
int i, n;
scanf("%d%d", &k, &n);
char a[10], b[10];
int aa, bb;
for(i=1; i<=n; i++)
{
scanf("%s%d%s%d", a, &aa, b, &bb);
ans += abs(aa-bb);
if(a[0] != b[0])
{
N++;
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... |