제출 #224289

#제출 시각아이디문제언어결과실행 시간메모리
224289MKopchev보물 찾기 (CEOI13_treasure2)C++14
10 / 100
5 ms384 KiB
#include<bits/stdc++.h> #include "treasure.h" using namespace std; const int nmax=100+42; int n; bool output[nmax][nmax]; /* int countTreasure(int x1,int y1,int x2,int y2) { cout<<x1<<" "<<y1<<" "<<x2<<" "<<y2<<endl; int ret; cin>>ret; return ret; } void Report(int i,int j) { cout<<"treasure: "<<i<<" "<<j<<endl; } */ void findTreasure(int N) { n=N; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(countTreasure(i,j,i,j))output[i][j]=1; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(output[i][j])Report(i,j); } /* int main() { findTreasure(2); } */
#Verdict Execution timeMemoryGrader output
Fetching results...