| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 927991 |
2024-02-15T16:12:07 Z |
pan |
Poi (IOI09_poi) |
C++17 |
|
264 ms |
20644 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll n, t, p, temp;;
vector<ll> ac, score;
vector<vector<ll> > task;
bool compare(ll a, ll b)
{
if (score[a]==score[b])
{
if (ac[a]==ac[b]) return a<b;
return ac[a]>ac[b];
}
return score[a]>score[b];
}
int main()
{
input(n); input(t); input(p);
vector<ll> rank(n);
ac.assign(n, 0); score.assign(n, 0); task.resize(t);
for (ll i=0; i<n; ++i)
{
rank[i] = i;
for (ll j=0; j<t; ++j)
{
input(temp);
if (temp) {ac[i]++; task[j].pb(i);}
}
}
for (ll i=0; i<t;++i)
{
ll point = n-task[i].size();
for (ll u: task[i]) score[u]+=point;
}
sort(rank.begin(), rank.end(), compare);
ll ind = find(rank.begin(), rank.end(), p-1)-rank.begin() +1;
printf("%lld%c%lld%c", score[p-1], ' ', ind, '\n');
return 0;
}
Compilation message
poi.cpp: In function 'int main()':
poi.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | #define input(x) scanf("%lld", &x);
| ~~~~~^~~~~~~~~~~~
poi.cpp:44:2: note: in expansion of macro 'input'
44 | input(n); input(t); input(p);
| ^~~~~
poi.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | #define input(x) scanf("%lld", &x);
| ~~~~~^~~~~~~~~~~~
poi.cpp:44:12: note: in expansion of macro 'input'
44 | input(n); input(t); input(p);
| ^~~~~
poi.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | #define input(x) scanf("%lld", &x);
| ~~~~~^~~~~~~~~~~~
poi.cpp:44:22: note: in expansion of macro 'input'
44 | input(n); input(t); input(p);
| ^~~~~
poi.cpp:11:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
11 | #define input(x) scanf("%lld", &x);
| ~~~~~^~~~~~~~~~~~
poi.cpp:52:4: note: in expansion of macro 'input'
52 | input(temp);
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
412 KB |
Output is correct |
| 11 |
Correct |
9 ms |
1372 KB |
Output is correct |
| 12 |
Correct |
13 ms |
1628 KB |
Output is correct |
| 13 |
Correct |
45 ms |
4188 KB |
Output is correct |
| 14 |
Correct |
55 ms |
5204 KB |
Output is correct |
| 15 |
Correct |
98 ms |
11344 KB |
Output is correct |
| 16 |
Correct |
107 ms |
11452 KB |
Output is correct |
| 17 |
Correct |
162 ms |
14348 KB |
Output is correct |
| 18 |
Correct |
187 ms |
14556 KB |
Output is correct |
| 19 |
Correct |
240 ms |
18256 KB |
Output is correct |
| 20 |
Correct |
264 ms |
20644 KB |
Output is correct |
