# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
232464 | VEGAnn | Titlovi (COCI19_titlovi) | C++14 | 7 ms | 3456 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 ft first
#define sd second
#define sz(x) ((int)x.size())
using namespace std;
const int N = 100100;
string s[N], cur;
int n = 0, T;
int i(char c){
return (c - '0');
}
void OUT(int x, int len){
cur = to_string(x);
while (sz(cur) < len)
cur = "0" + cur;
cout << cur;
}
void out(int h, int m, int s, int t){
t += T;
s += t / 1000 - bool(t < 0);
t %= 1000;
t = (t + 1000) % 1000;
m += s / 60 - bool(s < 0);
s %= 60;
s = (s + 60) % 60;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |