| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 77163 | sh25_shenpy | 宝藏图 | C++ | Accepted | 0 MS | 252 KB | 431 | 2025-12-21 15:00:29 |
#include<iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int map[n][m]; int treature=0,trap=0; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ cin>>map[i][j]; if(map[i][j]==1){ treature++; }else if(map[i][j]==-1){ trap++; } } } double treatureRate=(double)treature/(n*m); double trapRate=(double)trap/(n*m); cout<<treatureRate<<" "<<trapRate<<endl; return 0; }