Submission #3644744


Source Code Expand

/*

                   _ooOoo_
                  o8888888o
                  88" . "88
                  (| -_- |)
                  O\  =  /O
               ____/`---'\____
             .'  \\|     |//  `.
            /  \\|||  :  |||//  \
           /  _||||| -:- |||||-  \
           |   | \\\  -  /// |   |
           | \_|  ''\---/''  |   |
           \  .-\__  `-`  ___/-. /
         ___`. .'  /--.--\  `. . __
      ."" '<  `.___\_<|>_/___.'  >'"".
     | | :  `- \`.;`\ _ /`;.`/ - ` : | |
     \  \ `-.   \_ __\ /__ _/   .-` /  /
======`-.____`-.___\_____/___.-`____.-'======
                   `=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                    prayer
*/

// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(long long i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(_,v.size())cout<<" "<<v[_];cout<<endl;
#define show2d(v) rep(__,v.size()){rep(_,v[__].size())cout<<" "<<v[__][_];cout<<endl;}
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
// typedef tuple<int,int,int> tp;
// typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

signed main(){
	int n,m;
	cin>>n>>m;
	rep(i,m){
		int a,b;
		cin>>a>>b;
	}
	cin>>m;
	rep(i,n){
		cout<<1<<" "<<i+1<<endl;
	}
}














Submission Info

Submission Time
Task A - Problem 2
User ixmel_rd
Language C++14 (GCC 5.4.1)
Score 676000
Code Size 2567 Byte
Status AC
Exec Time 9 ms
Memory 256 KB

Judge Result

Set Name sample_00 sample_01 random_00 random_01 random_02 random_03 random_04 random_05 random_06 random_07 random_08 random_09 random_10 random_11 random_12 random_13 random_14 random_15 random_16 random_17 random_18 random_19 random_20 random_21 random_22 random_23 random_24 random_25 random_26 random_27
Score / Max Score 5700 / 1000000 6300 / 1000000 9900 / 1000000 14600 / 1000000 5200 / 1000000 17200 / 1000000 13300 / 1000000 5600 / 1000000 29800 / 1000000 23900 / 1000000 10700 / 1000000 30300 / 1000000 48200 / 1000000 7200 / 1000000 40100 / 1000000 54600 / 1000000 50300 / 1000000 33900 / 1000000 16800 / 1000000 25600 / 1000000 8500 / 1000000 26300 / 1000000 39200 / 1000000 9300 / 1000000 31700 / 1000000 12600 / 1000000 7600 / 1000000 7300 / 1000000 41600 / 1000000 42700 / 1000000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
sample_00 00_sample_00
sample_01 00_sample_01
random_00 10_random_00
random_01 10_random_01
random_02 10_random_02
random_03 10_random_03
random_04 10_random_04
random_05 10_random_05
random_06 10_random_06
random_07 10_random_07
random_08 10_random_08
random_09 10_random_09
random_10 10_random_10
random_11 10_random_11
random_12 10_random_12
random_13 10_random_13
random_14 10_random_14
random_15 10_random_15
random_16 10_random_16
random_17 10_random_17
random_18 10_random_18
random_19 10_random_19
random_20 10_random_20
random_21 10_random_21
random_22 10_random_22
random_23 10_random_23
random_24 10_random_24
random_25 10_random_25
random_26 10_random_26
random_27 10_random_27
Case Name Status Exec Time Memory
00_sample_00 AC 1 ms 256 KB
00_sample_01 AC 1 ms 256 KB
10_random_00 AC 1 ms 256 KB
10_random_01 AC 2 ms 256 KB
10_random_02 AC 1 ms 256 KB
10_random_03 AC 5 ms 256 KB
10_random_04 AC 1 ms 256 KB
10_random_05 AC 1 ms 256 KB
10_random_06 AC 7 ms 256 KB
10_random_07 AC 6 ms 256 KB
10_random_08 AC 2 ms 256 KB
10_random_09 AC 5 ms 256 KB
10_random_10 AC 9 ms 256 KB
10_random_11 AC 1 ms 256 KB
10_random_12 AC 3 ms 256 KB
10_random_13 AC 9 ms 256 KB
10_random_14 AC 9 ms 256 KB
10_random_15 AC 9 ms 256 KB
10_random_16 AC 2 ms 256 KB
10_random_17 AC 7 ms 256 KB
10_random_18 AC 1 ms 256 KB
10_random_19 AC 6 ms 256 KB
10_random_20 AC 5 ms 256 KB
10_random_21 AC 3 ms 256 KB
10_random_22 AC 9 ms 256 KB
10_random_23 AC 2 ms 256 KB
10_random_24 AC 2 ms 256 KB
10_random_25 AC 1 ms 256 KB
10_random_26 AC 6 ms 256 KB
10_random_27 AC 6 ms 256 KB