# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1054167 | 2024-08-12T07:12:15 Z | FaustasK | Palembang Bridges (APIO15_bridge) | C++14 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; struct gyventojas { char p; int s; char q; int t; }; const int maxn = 100000; int k, n; gyventojas M[maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> k >> n; long long A_puse = 0; long long B_puse = 0; vector <int> reikalingi; vector <int> nereikalingi; for(int i = 0; i<n; i++) { cin >> M[i].p >> M[i].s >> M[i].q >> M[i].t; if(M[i].p != M[i].q) { reikalingi.push_back(i); if(M[i].p == 'A' && M[i].q == 'B') { A_puse += M[i].s; B_puse += M[i].t; } else { A_puse += M[i].t; B_puse += M[i].s; } } else nereikalingi.push_back(i); } int kiek = reikalingi.size(); long long ats = 0; if(kiek>0) { long long suma = A_puse + B_puse; double liekana1 = suma%2; //cout << liekana1 << endl; liekana1/=2; suma/=2; //cout << suma << endl; //cout << liekana1 << endl; double liekana2 = suma%kiek; //cout << liekana2 << endl; liekana2 += liekana1; //cout << liekana2 << endl; liekana2/=kiek; //cout << liekana2 << endl; suma/=kiek; //cout << suma << endl; double dsuma = suma + liekana2; //cout << dsuma << endl; int tiltas = round(dsuma); //cout << ats; for(int i = 0; i<reikalingi.size(); i++) { int j = reikalingi[i]; ats += abs(M[j].s - tiltas) + abs(M[j].t - tiltas); } } for(int i = 0; i<nereikalingi.size(); i++) { int j = nereikalingi[i]; ats += abs(M[j].s - M[j].t); } cout << ats + reikalingi.size(); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 1 ms | 348 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 0 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |