Submission #1414654


Source Code Expand

#include <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) begin(r),end(r)
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)
#define vvl(v,w,h,init) vector<vector<ll>> v(w,vector<ll>(h,init))
#define mp(a,b) make_pair(a,b)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using pii = pair<int,int> ;
using pll = pair<ll,ll> ;

const ll mod = 1e9+7;
constexpr ll inf = ((1<<30)-1)*2+1 ;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0,1,-1,1,-1};
const int dx[] = {0,-1,0,1,1,-1,-1,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

ll w,h,n;
char v[51][51];
vector<string> ans;

string conv(char c,char d){
  return c + " " + d;
}
string conv(int c,int d){
  return to_string(c) + " " + to_string(d);
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> w >> h >> n;
  rep(i,w){
    rep(j,h){
      cin >> v[i][j];
    }
  }
  rep(k,50){
    rep(i,6){
      rep(j,8){
        ans.push_back(conv(k+1,i * 8 + j+1));
      }
    }
  }
  cout << ans.size()/8 << endl;
  rep(i,ans.size()){
    cout << ans[i] << endl;
  }
  return 0;
}

Submission Info

Submission Time
Task A - Multiple Pieces
User Halksel
Language C++14 (GCC 5.4.1)
Score 49322
Code Size 1689 Byte
Status AC
Exec Time 6 ms
Memory 384 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10
Score / Max Score 4942 / 1343058 3392 / 1343058 5288 / 1343058 5309 / 1343058 5133 / 1343058 5776 / 1343058 4593 / 1343058 3890 / 1343058 6085 / 1343058 4914 / 1343058
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 6 ms 384 KB
subtask_01_02.txt AC 6 ms 384 KB
subtask_01_03.txt AC 6 ms 384 KB
subtask_01_04.txt AC 6 ms 384 KB
subtask_01_05.txt AC 6 ms 384 KB
subtask_01_06.txt AC 6 ms 384 KB
subtask_01_07.txt AC 6 ms 384 KB
subtask_01_08.txt AC 6 ms 384 KB
subtask_01_09.txt AC 6 ms 384 KB
subtask_01_10.txt AC 6 ms 384 KB