# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
43570 | 2018-03-17T19:44:22 Z | duiceman | Palembang Bridges (APIO15_bridge) | C++14 | 4 ms | 3860 KB |
#include <bits/stdc++.h> using namespace std; #define x first #define y second #define umap unordered_map #define pqueue priority_queue #define mset multiset #define mp make_pair #define mt make_tuple #define all(x) x.begin(),x.end() #define long long long #define MOD 1000000007 #define MAX (long)(1e16+5) #define MIN (long)(-1e16-5) #define FILEIN_ freopen("__in.txt","r",stdin) #define FILEOUT_ freopen("__out.txt","w",stdout) #define FILEIO_ freopen("__in.txt","r",stdin),freopen("__out.txt","w",stdout) #define FILEIN(text) freopen(text,"r",stdin) #define FILEOUT(text) freopen(text,"w",stdout) #define FILEIO(text) freopen(text".in","r",stdin),freopen(text".out","w",stdout) char c1[5],c2[5]; umap<long,long> in,out,bef; pair<long,long> a[100005]; main(){ long t,i,j,k,n,m,x,y,res=0,l=0,r=0,mn=MAX,mid,idx,v,lst,sz; mset<long> pos; //mset<long> apos; in.reserve(200005); out.reserve(200005); scanf("%lld %lld",&m,&n); if(m != 1) return 136; for(i = 1; i <= n; i++){ scanf("%s %lld %s %lld",c1,&x,c2,&y); x++; y++; if(x > y) swap(x,y); res += abs(y-x); if(c1[0] == c2[0]){ n--; i--; continue; } a[i] = {x,y}; res++; } sort(a+1,a+1+n); l = r = 0; y = 0; pos.emplace(0); sz = 1; auto it = pos.begin(); idx = v = 0; for(i = 1; i <= n; i++){ x = a[i].x; y = a[i].y; in[x]++; out[y]++; sz += 2; pos.emplace(x); pos.emplace(y); if(x > v){ r++; res += (x-v)*2; } else if(y <= v){ // printf(">>>>>> %d %d\n",y,v); l++; idx += 2; res += (v-y)*2; } else if(x < v){ idx++; } mid = (sz-1)/2+1; while(idx < mid){ idx++; it++; lst = v; v = *it; if(v == lst) continue; res -= (v-lst)*r*2; res += (v-lst)*l*2; r -= in[v]; l += out[v]; } } printf("%lld\n",res); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3448 KB | Output is correct |
2 | Correct | 4 ms | 3552 KB | Output is correct |
3 | Incorrect | 4 ms | 3624 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3640 KB | Output is correct |
2 | Correct | 4 ms | 3696 KB | Output is correct |
3 | Incorrect | 4 ms | 3860 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 3860 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 3860 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 3860 KB | Execution failed because the return code was nonzero |
2 | Halted | 0 ms | 0 KB | - |