Submission #3644754


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<<i+1<<" "<<i+1<<endl;
	}
}














Submission Info

Submission Time
Task A - Problem 1
User ixmel_rd
Language C++14 (GCC 5.4.1)
Score 52935
Code Size 2569 Byte
Status AC
Exec Time 10 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 full_00 full_01 full_02 full_03 full_04 full_05 full_06 full_07 full_08 sparse_00 sparse_01 sparse_02 sparse_03 sparse_04 sparse_05 sparse_06 sparse_07 random_max full_max
Score / Max Score 3 / 1000000 45 / 1000000 700 / 1000000 4634 / 1000000 2513 / 1000000 3280 / 1000000 344 / 1000000 2526 / 1000000 3281 / 1000000 2491 / 1000000 3323 / 1000000 4095 / 1000000 2579 / 1000000 95 / 1000000 903 / 1000000 2586 / 1000000 5245 / 1000000 444 / 1000000 2288 / 1000000 2410 / 1000000 139 / 1000000 192 / 1000000 143 / 1000000 93 / 1000000 378 / 1000000 82 / 1000000 134 / 1000000 181 / 1000000 2780 / 1000000 5028 / 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
full_00 20_full_00
full_01 20_full_01
full_02 20_full_02
full_03 20_full_03
full_04 20_full_04
full_05 20_full_05
full_06 20_full_06
full_07 20_full_07
full_08 20_full_08
sparse_00 30_sparse_00
sparse_01 30_sparse_01
sparse_02 30_sparse_02
sparse_03 30_sparse_03
sparse_04 30_sparse_04
sparse_05 30_sparse_05
sparse_06 30_sparse_06
sparse_07 30_sparse_07
random_max 60_random_max_00
full_max 70_full_max_00
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 8 ms 256 KB
10_random_02 AC 8 ms 256 KB
10_random_03 AC 5 ms 256 KB
10_random_04 AC 1 ms 256 KB
10_random_05 AC 6 ms 256 KB
10_random_06 AC 6 ms 256 KB
10_random_07 AC 4 ms 256 KB
10_random_08 AC 5 ms 256 KB
20_full_00 AC 6 ms 256 KB
20_full_01 AC 3 ms 256 KB
20_full_02 AC 1 ms 256 KB
20_full_03 AC 2 ms 256 KB
20_full_04 AC 3 ms 256 KB
20_full_05 AC 8 ms 256 KB
20_full_06 AC 2 ms 256 KB
20_full_07 AC 3 ms 256 KB
20_full_08 AC 3 ms 256 KB
30_sparse_00 AC 2 ms 256 KB
30_sparse_01 AC 2 ms 256 KB
30_sparse_02 AC 2 ms 256 KB
30_sparse_03 AC 2 ms 256 KB
30_sparse_04 AC 3 ms 256 KB
30_sparse_05 AC 2 ms 256 KB
30_sparse_06 AC 2 ms 256 KB
30_sparse_07 AC 2 ms 256 KB
60_random_max_00 AC 10 ms 256 KB
70_full_max_00 AC 9 ms 256 KB