QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #586659 | #9370. Gambling on Choosing Regionals | roufubo | TL | 200ms | 11416kb | C++14 | 846b | 2024-09-24 14:53:45 | 2024-09-24 14:53:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n, k;
int c[100005], C = 1e9 + 7;
int a[100005], w[100005];
string s[100005];
map<string, int>mp;
int d;
vector<int>v[100005];
int main() {
scanf("%d %d", &n, &k);
for (int i = 1; i <= k; i++) {
scanf("%d", &c[i]);
if (c[i] < C)C = c[i];
}
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
cin >> s[i];
if (mp[s[i]] == 0) {
mp[ s[i] ] = ++d;
}
w[i] = mp[ s[i] ];
v[ w[i] ].push_back(a[i]);
}
for (int i = 1; i <= d; i++)sort(v[i].begin(), v[i].end(), greater<int>());
for (int i = 1; i <= n; i++) {
int ans = 1;
for (int j = 1; j <= d; j++) {
int m = C;
if (j == w[i])m--;
for (int k = 0; k < min(m, int(v[j].size())); k++) {
if (a[i] < v[j][k])ans++;
else break;
}
}
printf("%d\n", ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 10404kb
input:
5 3 1 2 3 100 THU 110 PKU 95 PKU 105 THU 115 PKU
output:
2 1 2 2 1
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 9448kb
input:
5 2 2 3 100 THU 110 PKU 95 PKU 105 THU 115 PKU
output:
4 2 4 3 1
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 200ms
memory: 11416kb
input:
100000 100000 57148 51001 13357 71125 98369 67226 49388 90852 66291 39573 38165 97007 15545 51437 89611 41523 27799 15529 16434 44291 47134 90227 26873 52252 41605 21269 9135 55784 70744 17563 79061 73981 70529 35681 91073 52031 23811 79501 1607 46365 76868 72137 71041 29217 96749 46417 40199 55907 ...
output:
1000 999 1000 1000 1000 1000 1000 1000 1000 869 1000 958 1000 1000 1000 1000 999 1000 1000 1000 1000 1000 1000 990 1000 1000 1000 631 1000 1000 1000 956 1000 1000 1000 1000 1000 1000 575 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 1000 993 1000 1000 999 1000 995 1000 1...
result:
ok 100000 lines
Test #4:
score: -100
Time Limit Exceeded
input:
100000 100000 67147 61000 23356 81124 108368 77225 59387 100851 76290 49572 48164 107006 25544 61436 99610 51522 37798 25528 26433 54290 57133 100226 36872 62251 51604 31268 19134 65783 80743 27562 89060 83980 80528 45680 101072 62030 33810 89500 11606 56364 86867 82136 81040 39216 106748 56416 5019...
output:
38094 68893 8008 72205 14144 6830 48242 54784 24827 22671 69968 63405 42977 34955 37074 72306 21663 58078 74211 68516 24344 37264 47307 18059 34775 56816 64113 72997 71482 13161 47439 48057 22609 73410 55895 53054 66205 5075 27380 71695 15008 61428 73978 50256 39523 68470 73731 20025 19546 73505 345...