QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #572501 | #9320. Find the Easiest Problem | MiniLong | AC ✓ | 37ms | 7972kb | C++17 | 3.0kb | 2024-09-18 14:58:17 | 2024-09-18 14:58:17 |
Judging History
answer
#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
#ifdef ONLINE_JUDGE
char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
#define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
#else
#define get() getchar()
#endif
template<typename T> inline void read(T &t){
T x = 0, f = 1;
char c = getchar();
while(!isdigit(c)){
if(c == '-') f = -f;
c = getchar();
}
while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
t = x * f;
}
template<typename T, typename ... Args> inline void read(T &t, Args&... args){
read(t);
read(args...);
}
template<typename T> void write(T t){
if(t < 0) putchar('-'), t = -t;
if(t >= 10) write(t / 10);
putchar(t % 10 + '0');
}
template<typename T, typename ... Args> void write(T t, Args... args){
write(t), putchar(' '), write(args...);
}
template<typename T> void writeln(T t){
write(t);
puts("");
}
template<typename T> void writes(T t){
write(t), putchar(' ');
}
#undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
const ll mod = 998244353;
ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
void add(ll &x, ll y){x = (x + y) % mod;}
void mul(ll &x, ll y){x = x * y % mod;}
ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e5 + 5;
int n, cnt;
map<string, int> id;
vector<string> ch;
vector<string> v[N];
string a, b, c;
int main(){
multitest(){
read(n);
ch.resize(1);
_rep(i, 1, n){
cin >> a >> b >> c;
if(!id[b]) id[b] = ++cnt, ch.pb(b);
if(c[0] == 'a') v[id[b]].pb(a);
}
string ans = ""; int res = 0;
_rep(i, 1, cnt){
sort(v[i].begin(), v[i].end());
v[i].erase(unique(v[i].begin(), v[i].end()), v[i].end());
if(v[i].size() > res || v[i].size() == res && ch[i] < ans) ans = ch[i], res = v[i].size();
}
cout << ans << endl;
_rep(i, 1, cnt) v[i].clear();
cnt = 0, id.clear(), ch.clear();
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 6228kb
input:
2 5 teamA A accepted teamB B rejected teamC A accepted teamB B accepted teamD C accepted 4 teamA A rejected teamB A accepted teamC B accepted teamC B accepted
output:
A A
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 26ms
memory: 5940kb
input:
1000 44 WaiooyIXa O accepted WaiooyIXa P accepted ZYYsNWag P accepted DPIawQg D rejected IzPdjnM Z rejected Ra D rejected kwQyGxLo I rejected DPIawQg L accepted kwQyGxLo I accepted mmWxDuADCB D rejected PXwVAOgwiz P rejected ZYYsNWag U accepted IzPdjnM Z accepted TgBNO P rejected kwQyGxLo J accepted...
output:
Z E Z I B I G H S K J I H R Z C K O I P A B I A A N A B A O F O R T H G K E S D F D R C U V W P A O J E A B U M C T L G V A Z N E O Q F B G J I E M A A E A K J J S E W Z K F I S P M H G G H W I P T D O A F N C S Y Z S G J F Q F O C B B U C I A E I P K C R X N D N L Q L I X I H U J Z D K G F T F B H ...
result:
ok 1000 lines
Test #3:
score: 0
Accepted
time: 21ms
memory: 6200kb
input:
1000 39 OnYbTl Y accepted m I accepted NJN T accepted lTGE D accepted mi K accepted ttcHrVD W accepted hvGveRIr J rejected zTwvbWhhQT S rejected VlAcLAHas E accepted hM H accepted wltR G rejected JJWtQ H accepted zVwBtj L rejected ZVqAWCsj I rejected BwuM B accepted IpUXa R rejected OdSv D rejected ...
output:
H R M I S J D D A E X S I D D A I N G O F G G B A J E H D I G M O N C G F L V D C S B U H W L J C O B D L N D V K M Z C T H K U I T R R Q D B E F A Q O F M C T M E Y L K Q K E A O E J O B N R A E D I A Q W A M A Z W K M I J B F L X E R G A I H Q P T E K L Q U C A F C A S N G G U L J J A A J A B A E ...
result:
ok 1000 lines
Test #4:
score: 0
Accepted
time: 27ms
memory: 6904kb
input:
1000 15 vCproSIO G rejected vCproSIO H rejected ySoEaGKbVz R rejected ySoEaGKbVz M accepted vCproSIO Z rejected ySoEaGKbVz C rejected YVCmuO H accepted XHHVYm Y rejected YVCmuO H rejected vCproSIO S accepted ySoEaGKbVz J accepted YVCmuO P rejected ySoEaGKbVz E rejected XHHVYm O accepted vCproSIO T r...
output:
H A F A N J B C H T B L G Z J H F A B H A O V E B O L B J D I Y M B Q B F E T B T C C X E P S M A Q G D A A H I H E D C A A V C B C D E B F I D C M J P N F V K E K K B B F Q L B E Q A R E V C Y D I C H N H G G M A H E D U N N M R K C B F O H V I A U R Y D A A A G E N N L C A E C B Z P W K U D H D V ...
result:
ok 1000 lines
Test #5:
score: 0
Accepted
time: 11ms
memory: 7296kb
input:
1 27400 RPRPRNWL O accepted UTqhXsDpY R rejected BabD A rejected eNM Y rejected HzIyx S accepted phWEJVQ N rejected NbisS Q accepted cTIsPKm Y rejected sElDxdT T accepted BJuQR Q rejected vfPJs W rejected eF Z accepted KyOHzFtXm B accepted wZlyz T accepted acDVjN C accepted M X rejected sW A accepte...
output:
P
result:
ok single line: 'P'
Test #6:
score: 0
Accepted
time: 9ms
memory: 7068kb
input:
1 29702 Wsfzx N rejected yZkJOvtRG B rejected Wsfzx A accepted yZkJOvtRG C rejected F G accepted kyUxIv U accepted li R rejected F Q rejected F Y accepted F I accepted yZkJOvtRG J rejected Wsfzx C rejected Wsfzx V accepted yZkJOvtRG L rejected F X rejected kyUxIv K accepted li G accepted Wsfzx Z acc...
output:
A
result:
ok single line: 'A'
Test #7:
score: 0
Accepted
time: 37ms
memory: 7972kb
input:
1 99584 I Y rejected I F accepted I Z rejected I G accepted I J rejected I A rejected I C rejected I R rejected I J accepted I L rejected I A rejected I L accepted I E rejected I O accepted I P accepted I F rejected I O accepted I E accepted I W accepted I X rejected I G accepted I R rejected I A re...
output:
A
result:
ok single line: 'A'
Test #8:
score: 0
Accepted
time: 10ms
memory: 6584kb
input:
1 26160 QmDDKxIel A rejected gmxZDM O rejected thXodr Z accepted sznPsL Z accepted VynmaLp B rejected MfJQRamC T rejected W W accepted WFqnF T accepted QRys Y accepted Q H accepted XUiMDH H accepted fPcwpz U rejected oEqrrOAv D rejected aeW O accepted M B accepted JYzynly O accepted JJqNf G rejected...
output:
E
result:
ok single line: 'E'
Test #9:
score: 0
Accepted
time: 25ms
memory: 5992kb
input:
1000 81 pnnCvDUIH B rejected rdcJWGYGhk B accepted VBFvmoYLn B accepted jdMRRJuIpZ B rejected WLewtGWJw A rejected zGAkWsrfG A accepted MDzQocBGr A rejected XufUaIWaKT A accepted JachfkiYL A rejected zvDlkMINf B rejected NMfFDEVhG A rejected axiTyJnXu B accepted wLkSOTqqV A rejected amkUqtOyMB B rej...
output:
B B B B B A B A A A B B B A A B B A B A A A B A A B B B A A A B B A A B A B B B A B A B B A B A A A A A B A B B A A A A B A B A A A B A A B B A A A B B A A B B B A A A A A A B A B B B B A A B B B B B A B A A B A A B A A B A B A A A B B A A B A B B A B A B A A A B B A A A B B A A A A B A B A A A A A ...
result:
ok 1000 lines
Test #10:
score: 0
Accepted
time: 29ms
memory: 6524kb
input:
1 61839 BGQriOTlZ B rejected ZIqGhTsmH B rejected DxIVjUqBr A rejected afbRvvloO A accepted LskKGrpIx A rejected zGnHxzKmA B rejected bHSaQfYtu A rejected xPTMHyQgD B rejected xWrkTqLhH B accepted tGUVjSpmjI A accepted bBBZKwbsw A accepted IAaiNrLMLe B accepted bglBZRQuk B accepted DtLTczAkJo A reje...
output:
B
result:
ok single line: 'B'
Extra Test:
score: 0
Extra Test Passed