Submission #10703030
Source Code Expand
#pragma GCC optimize("Ofast")
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <iomanip>
#include <functional>
#include <complex>
using namespace std;
using ll=long long int;
using pii=pair<int,int>;
using pil=pair<int,ll>;
using pli=pair<ll,int>;
using pll=pair<ll,ll>;
using psi=pair<string,int>;
using pis=pair<int,string>;
using psl=pair<string,ll>;
using pls=pair<ll,string>;
using pss=pair<string,string>;
template<typename T> using vc=vector<T>;
template<typename T> using vvc=vector<vector<T>>;
template<typename T> using vvvc=vector<vector<vector<T>>>;
template<typename T> using vvvvc=vector<vvvc<T>>;
template<typename T> using vvvvvc=vector<vvvvc<T>>;
template<class T,class U>inline constexpr bool chmin(T&a,const U b){if(a<=b)return false;a=b;return true;}
template<class T,class U>inline constexpr bool chmax(T&a,const U b){if(a>=b)return false;a=b;return true;}
#define bit(n,k) ( (n>>k)&1 )
inline void bin101(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(20);
}
//デバッグ
template<typename T>
inline void vout(const vector<T> &v){
cout<<"\nstart\n";
const int sz=v.size();
for(int i=0;i<sz;i++){
cout<<i<<" "<<v[i]<<'\n';
}
cout<<"end\n"<<endl;
}
//デバッグ
template<typename T>
inline void vout(const vvc<T> &v){
cout<<"\nstart\n";
const int sz=v.size();
for(int i=0;i<sz;i++){
int ssz=v[i].size();
for(int j=0;j<ssz;j++){
cout<<i<<" "<<j<<" "<<v[i][j]<<'\n';
}
}
cout<<"end\n"<<endl;
}
//デバッグ
template<typename T>
inline void vout(const vvvc<T> &v){
cout<<"\nstart\n";
const int sz=v.size();
for(int i=0;i<sz;i++){
int ssz=v[i].size();
for(int j=0;j<ssz;j++){
int sssz=v[i][j].size();
for(int k=0;k<sssz;k++){
cout<<i<<" "<<j<<" "<<k<<" "<<v[i][j][k]<<'\n';
}
}
}
cout<<"end\n"<<endl;
}
//pair cout
template<typename T, typename U>
inline ostream &operator<<(ostream &os,const pair<T,U> &p) {
os<<p.first<<" "<<p.second;
return os;
}
//pair cin
template<typename T, typename U>
inline istream &operator>>(istream &is,pair<T,U> &p) {
is>>p.first>>p.second;
return is;
}
//ソート
template<typename T>
inline void vsort(vector<T> &v){
sort(v.begin(),v.end());
}
//逆順ソート
template<typename T>
inline void rvsort(vector<T> &v){
sort(v.rbegin(),v.rend());
}
//要素数a 初期値x
template<typename T>
inline vector<T> vmake(int a,T x){
return vector<T>(a,x);
}
//data[a][b] 初期値x
template<typename T>
inline vector<vector<T>> vmake(int a,int b,T x){
return vector<vector<T>>(a, vector<T>(b,x));
}
//data[a][b][c] 初期値x
template<typename T>
inline vector<vector<vector<T>>> vmake(int a,int b,int c,T x){
return vector<vector<vector<T>>> (a, vector<vector<T>>(b, vector<T>(c, x)));
}
//data[a][b][c][d] 初期値x
template<typename T>
inline vector<vector<vector<vector<T>>>> vmake(int a,int b,int c,int d,T x){
return vector<vector<vector<vector<T>>>> (a,vvvc<T>(b,vvc<T>(c,vc<T>(d,x))));
}
//data[a][b][c][d][e] 初期値x
template<typename T>
inline vvvvvc<T> vmake(int a,int b,int c,int d,int e,T x){
return vvvvvc<T> (a,vvvvc<T>(b,vvvc<T>(c,vvc<T>(d,vc<T>(e,x)))));
}
//1ビットの数を返す
inline int popcount(int x){
return __builtin_popcount(x);
}
//1ビットの数を返す
inline int popcount(ll x){
return __builtin_popcountll(x);
}
//queのfront() pop()
template<typename T>
inline T pop(queue<T> &que){
T x=que.front();
que.pop();
return x;
}
//priority_que top() pop()
template<typename T>
inline T pop(priority_queue<T> &que){
T x=que.top();
que.pop();
return x;
}
//stack top() pop()
template<typename T>
inline T pop(stack<T> &st){
T x=st.top();
st.pop();
return x;
}
#define intsz(x) ( (int)x.size() )
/*
満たすものの個数を返す
mode:0 x未満
mode:1 x以下の数
mode:2 x以上の数
mode:3 x超
mode:4 x
*/
template<typename T>
inline int count_bound(vector<T> &v,T x,int mode){
switch(mode){
case 0:
return lower_bound(v.begin(),v.end(),x)-v.begin();
case 1:
return upper_bound(v.begin(),v.end(),x)-v.begin();
case 2:
return v.end()-lower_bound(v.begin(),v.end(),x);
case 3:
return v.end()-upper_bound(v.begin(),v.end(),x);
case 4:
return upper_bound(v.begin(),v.end(),x)-lower_bound(v.begin(),v.end(),x);
}
}
/*
mode:0 xより小さい数で最大の数
mode:1 x以下の数で最大の数
mode:2 x以上の数で最小の数
mode:3 xより大きい数で最小の数
*/
template<typename T>
inline T value_bound(vector<T> &v,T x,int mode){
switch(mode){
case 0:
return *(--lower_bound(v.begin(),v.end(),x));
case 1:
return *(--upper_bound(v.begin(),v.end(),x));
case 2:
return *lower_bound(v.begin(),v.end(),x);
case 3:
return *upper_bound(v.begin(),v.end(),x);
}
}
constexpr int MAX=1<<30;
constexpr ll INF=1LL<<62;
constexpr ll MOD=1e9+7;
int dx[]={1,-1,0,0},dy[]={0,0,-1,1};
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
signed main(){
bin101();
for(int i=1;i<=30;i++){
for(int j=1;j<=30;j++){
int t;
cin>>t;
while(t--) cout<<i<<" "<<j<<endl;
}
}
}
Submission Info
Submission Time |
|
Task |
A - 高橋君の山崩しゲーム |
User |
bin101 |
Language |
C++14 (GCC 5.4.1) |
Score |
541032 |
Code Size |
6139 Byte |
Status |
AC |
Exec Time |
80 ms |
Memory |
512 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 |
55534 / 100000 |
53221 / 100000 |
54807 / 100000 |
51866 / 100000 |
54778 / 100000 |
54564 / 100000 |
53691 / 100000 |
55284 / 100000 |
53781 / 100000 |
53506 / 100000 |
Status |
|
|
|
|
|
|
|
|
|
|
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 |
73 ms |
512 KB |
subtask_01_02.txt |
AC |
80 ms |
512 KB |
subtask_01_03.txt |
AC |
74 ms |
512 KB |
subtask_01_04.txt |
AC |
78 ms |
512 KB |
subtask_01_05.txt |
AC |
77 ms |
512 KB |
subtask_01_06.txt |
AC |
75 ms |
512 KB |
subtask_01_07.txt |
AC |
77 ms |
512 KB |
subtask_01_08.txt |
AC |
74 ms |
512 KB |
subtask_01_09.txt |
AC |
77 ms |
512 KB |
subtask_01_10.txt |
AC |
77 ms |
512 KB |