Submission #5124456

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

const ll MOD=1e9+7;
const ll INF=1e18;
const double pi=acos(-1);
const double eps=1e-10;

int dx[]={1, 0, -1, 0};
int dy[]={0, -1, 0, 1};

int main(){
    vector<P> ans(101);
    int my = 100, mx;
    for(int i=0; i<84; i++){
        int r = (100 - i);
        if(i != 0 && i % 7 == 0){
            my = my + r + (r + 7);
        }

        if(i % 7 == 0) mx = 100;
        if(i % 7 == 1) mx = 299;
        if(i % 7 == 2) mx = 496;
        if(i % 7 == 3) mx = 691;
        if(i % 7 == 4) mx = 884;
        if(i % 7 == 5) mx = 1075;
        if(i % 7 == 6) mx = 1264;

        ans[r] = P(mx, my);
    }

    for(int i=16; i>=9; i--){
        ans[i] = P(1400, 100*(17 - i));
    }

    for(int i=8; i>=1; i--){
        ans[i] = P(1460, 100*(9 - i));
    }

    for(int i=1; i<=100; i++){
        cout << ans[i].fs << " " << ans[i].sc << endl;
    }
}

Submission Info

Judge Result