QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#796653#7604. Find the VertexCookie_CreammRE 0ms0kbC++231.1kb2024-12-01 23:11:282024-12-01 23:11:28

Judging History

你现在查看的是最新测评结果

  • [2024-12-01 23:11:28]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-12-01 23:11:28]
  • 提交

answer

#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define vt vector
#define pb push_back
#define pii pair<int, int>
#define sz(dq) (int)dq.size()
#define forr(i, a, b) for(int i = a; i < b; i++)
#define fi first
#define se second
#define pll pair<ll, ll>
#define mpp make_pair
#define ALL(v) v.begin(), v.end()
#define ALLR(v) v.rbegin(), v.rend()
#define ld long double
ifstream fin("store.inp");
ofstream fout("store.out");
const ll mxn = 5e5 + 5, inf = 1e9, mod = 998244353, sq = 800, mxv = 1e6 + 5, pr = 37, mod2 = 1e9 + 9, mod3 = 998244353;
//const int x[4] = {0, -1, 0, 1};
 
const int x[4] = {1, -1, 0, 0};
const int y[4] = {0, 0, 1, -1};
//const char dir[4] = {'D', 'U', 'R', 'L'};
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());


void solve(){   
    
    
    
}
 
signed main(){
    //ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   
    
    int tt; tt = 1;
    while(tt--){
        solve();
    }
    return(0);
}

详细

Test #1:

score: 0
Dangerous Syscalls

input:

5 6
1 0 1 1 2
5 4
1 2
3 2
3 4
4 2
1 5

output:


result: