| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 123800 | 刘子涵 | 选择客栈 | C++ | Accepted | 100 | 52 MS | 1024 KB | 280 | 2024-01-23 09:53:20 |
#include<bits/stdc++.h> using namespace std; int n,k,q,p[105],f[200002],d,c=0,z=0; int main(){ cin>>n>>k>>q; for(int i=1;i<=n;i++){ cin>>f[i]>>d; if(d<=q){ for(int j=i;j>z;j--) p[f[j]]++; z=i,c += p[f[i]]-1; }else c+=p[f[i]]; } cout<<c; return 0; }