# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1054195 | Mokocraft | Palembang Bridges (APIO15_bridge) | C++14 | 59 ms | 2100 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 <iostream>
#include <stdio.h>
#include <array>
#include <algorithm>
#include <vector>
#include <cmath>
int main()
{
//freopen("duotaA.txt", "r", stdin);
int K, N;
std::cin >> K >> N;
long long extra = 0;
std::vector<std::pair<int, int>> ranges;
for(int i = 0; i < N; i++)
{
int ai, bi;
char ac, bc;
std::cin >> ac >> ai >> bc >> bi;
if(ai > bi)
std::swap(ai, bi);
if(ac == bc)
extra += bi - ai;
else
ranges.push_back(std::make_pair(ai, bi));
}
# | 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... |