Submission #1000873
Source Code Expand
#include <cstdio> #include <algorithm> #include <stack> #include <queue> #include <deque> #include <vector> #include <string> #include <string.h> #include <cstdlib> #include <ctime> #include <cmath> #include <map> #include <set> #include <iostream> #include <sstream> #include <numeric> #include <cctype> #include <bitset> #include <cassert> #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next) #define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++) #define rng(a) a.begin(),a.end() #define maxs(x,y) x = max(x,y) #define mins(x,y) x = min(x,y) #define pb push_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcount #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define df(x) int x = in() #define dame { puts("-1"); return 0;} #define show(x) cout<<#x<<" = "<<x<<endl; #define PQ(T) priority_queue<T,vector<T>,greater<T> > using namespace std; typedef long long int ll; typedef pair<int,int> P; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<P> vp; inline int in() { int x; scanf("%d",&x); return x;} inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');} template<typename T>istream& operator>>(istream&i,vector<T>&v) {rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(vector<T>&v) {stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);} template<typename T>ostream& operator<<(ostream&o,vector<T>&v) {if(sz(v))o<<join(v);return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v) {return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v) {return o<<v.fi<<","<<v.se;} const int MX = 100005, INF = 1001001001; const ll LINF = 1e18; const double eps = 1e-10; // Mod int const int mod = 1000000007; struct mint { ll x; mint():x(0){} mint(ll x):x((x%mod+mod)%mod){} // mint(ll x):x(x){} mint& fix() { x = (x%mod+mod)%mod; return *this;} mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;} mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;} mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;} mint operator+(const mint& a)const{ return mint(*this) += a;} mint operator-(const mint& a)const{ return mint(*this) -= a;} mint operator*(const mint& a)const{ return mint(*this) *= a;} bool operator<(const mint& a)const{ return x < a.x;} bool operator==(const mint& a)const{ return x == a.x;} }; istream& operator>>(istream&i,mint&a){i>>a.x;return i;} ostream& operator<<(ostream&o,const mint&a){o<<a.x;return o;} typedef vector<mint> vm; // mint dp[5005][5005]; int main() { return 0; }
Submission Info
Submission Time | |
---|---|
Task | J - 123 Pairs |
User | snuke |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 3075 Byte |
Status | WA |
Exec Time | 198 ms |
Memory | 196096 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example0.txt, example1.txt |
All | 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, 039.txt, 040.txt, 041.txt, 042.txt, 043.txt, 044.txt, 045.txt, 046.txt, 047.txt, 048.txt, 049.txt, example0.txt, example1.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
000.txt | WA | 193 ms | 195968 KB |
001.txt | WA | 192 ms | 195968 KB |
002.txt | WA | 192 ms | 195968 KB |
003.txt | WA | 198 ms | 195968 KB |
004.txt | WA | 191 ms | 195968 KB |
005.txt | WA | 191 ms | 195968 KB |
006.txt | WA | 192 ms | 195968 KB |
007.txt | WA | 192 ms | 195968 KB |
008.txt | WA | 191 ms | 195968 KB |
009.txt | WA | 192 ms | 195968 KB |
010.txt | WA | 191 ms | 195968 KB |
011.txt | WA | 191 ms | 195968 KB |
012.txt | WA | 192 ms | 195968 KB |
013.txt | WA | 192 ms | 195968 KB |
014.txt | WA | 191 ms | 195968 KB |
015.txt | WA | 192 ms | 195968 KB |
016.txt | WA | 193 ms | 195968 KB |
017.txt | WA | 191 ms | 195968 KB |
018.txt | WA | 191 ms | 195968 KB |
019.txt | WA | 191 ms | 195968 KB |
020.txt | WA | 189 ms | 195968 KB |
021.txt | WA | 191 ms | 195968 KB |
022.txt | WA | 191 ms | 195968 KB |
023.txt | WA | 192 ms | 195968 KB |
024.txt | WA | 192 ms | 195968 KB |
025.txt | WA | 192 ms | 195968 KB |
026.txt | WA | 191 ms | 195968 KB |
027.txt | WA | 192 ms | 196096 KB |
028.txt | WA | 192 ms | 195968 KB |
029.txt | WA | 191 ms | 195968 KB |
030.txt | WA | 192 ms | 195968 KB |
031.txt | WA | 191 ms | 195968 KB |
032.txt | WA | 192 ms | 195968 KB |
033.txt | WA | 193 ms | 195968 KB |
034.txt | WA | 191 ms | 195968 KB |
035.txt | WA | 191 ms | 195968 KB |
036.txt | WA | 192 ms | 195968 KB |
037.txt | WA | 191 ms | 195968 KB |
038.txt | WA | 192 ms | 195968 KB |
039.txt | WA | 191 ms | 195968 KB |
040.txt | WA | 192 ms | 195968 KB |
041.txt | WA | 191 ms | 195968 KB |
042.txt | WA | 192 ms | 195968 KB |
043.txt | WA | 191 ms | 195968 KB |
044.txt | WA | 191 ms | 195968 KB |
045.txt | WA | 190 ms | 195968 KB |
046.txt | WA | 190 ms | 195968 KB |
047.txt | WA | 191 ms | 195968 KB |
048.txt | WA | 191 ms | 195968 KB |
049.txt | WA | 192 ms | 195968 KB |
example0.txt | WA | 192 ms | 195968 KB |
example1.txt | WA | 192 ms | 195968 KB |