| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 864077 |
2023-10-22T02:00:00 Z |
Tri2k6 |
Ljeto (COCI21_ljeto) |
C++17 |
|
0 ms |
504 KB |
#include <bits/stdc++.h>
using namespace std;
template<class integer>
inline integer to_int(const string& s, size_t* idx = 0, int base = 10) {
size_t n = s.size(), i = idx ? *idx : 0; bool sign = false; integer x = 0;
if (s[i] == '-')
++i, sign = true;
function<int(char)> char_to_digit = [&](char c) {
static const int d[] = {'a'-10,'0'};
return tolower(c)-d[isdigit(c)]; };
while (i < n)
x *= base, x += char_to_digit(s[i++]);
if (idx)
*idx = i;
return sign ? -x : x; }
template<class integer>
inline string to_string(integer x, int base = 10) {
bool sign = false; string s;
if (x < 0)
x = -x, sign = true;
function<char(int)> digit_to_char = [](int d) {
static const char c[] = {'a'-10,'0'};
return c[d < 10]+d; };
do
s += digit_to_char(x%base), x /= base;
while (x > 0);
if (sign)
s += '-';
reverse(s.begin(),s.end());
return s; }
template<class integer>
inline istream& read(istream& is, integer& x) {
string s; is >> s, x = to_int<integer>(s); return is; }
template<class integer>
inline ostream& write(ostream& os, integer x) { return os << to_string(x); }
using lll = signed __int128;
using ulll = unsigned __int128;
inline istream& operator>>(istream& is, lll &x) { return read(is,x); }
inline istream& operator>>(istream& is, ulll &x) { return read(is,x); }
inline ostream& operator<<(ostream& os, lll x) { return write(os,x); }
inline ostream& operator<<(ostream& os, ulll x) { return write(os,x); }
#define input cin
#define output cout
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define endl '\n'
#define all(v) v.begin(),v.end()
#define sorta(v) sort(v.begin(),v.end())
#define mem(a,b) memset(a,b,sizeof(a));
#define GetBit(u) (u & -u)
#define bit(u,i) ((u >> i) & 1)
#define mask(i) (1ll << i)
#define vi vector<int>
#define int128 __int128
#define fi first
#define se second
#define heap_max(a) priority_queue<a>
#define heap_min(a) priority_queue<a, vector<a>, greater <a>>
#define pb push_back
#define eb emplace_back
#define TASK "TASK"
const int cs = 2e5 + 7;
const int mod = 1e9 + 7;
const int INF = mod;
const int maxN = 2e3 + 7;
const int block_size = 320;
const ll oo = 1e18 + 7;
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
template<class T>
T Abs(const T &x) {
return (x < 0 ? -x : x);
}
template<class X, class Y>
void Add(X &x , const Y &y) {
x += y;
if (x > mod) x -= mod;
}
template<class X, class Y>
void Sub(X &x, const Y &y) {
x -= y;
if (x < 0) x += mod;
}
//
struct node {
int t,a,b;
node() {}
node(int tt,int aa,int bb) {
t = tt;
a = aa;
b = bb;
}
};
typedef struct node Node;
int n;
Node a[cs];
int Pretime[10] = {-1};
void nhap() {
input >> n;
for (int i = 1;i <= n;i++) {
int x,y,z;
input >> x >> y >> z;
a[i] = Node(x,y,z);
}
}
int GetIdx(int u) {
if (u <= 4) return 0;
return 1;
}
ll ans[2];
void Solve() {
sort(a + 1, a + n + 1, [&] (Node a, Node b) {
return a.t < b.t;
});
mem(Pretime,-1);
for (int i = 1;i <= n;i++) {
int t = a[i].t;
int u = a[i].a;
int v = a[i].b;
if (Pretime[u] == -1) {
Pretime[u] = t;
ans[GetIdx(u)] += 100;
} else {
if (Pretime[u] + 10 >= t) {
ans[GetIdx(u)] += 150;
} else {
ans[GetIdx(u)] += 100;
}
Pretime[u] = t;
}
}
output << ans[0] << ' ' << ans[1];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
// auto TIME1 = chrono::steady_clock::now();
int T = 1;
// input >> T;
while (T--) {
nhap();
Solve();
}
// auto TIME2 = chrono::steady_clock::now();
// auto DIFF = TIME2 - TIME1;
//cerr << "Time: " << fixed << setprecision(8) << chrono::duration<double>(DIFF).count() << "s.";
return 0;
}
Compilation message
Main.cpp: In function 'void Solve()':
Main.cpp:152:13: warning: unused variable 'v' [-Wunused-variable]
152 | int v = a[i].b;
| ^
Main.cpp: In function 'int main()':
Main.cpp:174:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
174 | freopen(TASK".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:175:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
175 | freopen(TASK".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
468 KB |
Output is correct |
| 4 |
Correct |
0 ms |
504 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
468 KB |
Output is correct |
| 6 |
Correct |
0 ms |
504 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
460 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Correct |
0 ms |
348 KB |
Output is correct |
